On the Length of Shortest Strings Accepted by Two-way Finite Automata.
Egor DobronravovNikita DobronravovAlexander OkhotinPublished in: Fundam. Informaticae (2021)
Keyphrases
- finite automata
- longest common subsequence
- probabilistic automata
- deterministic automata
- regular expressions
- finite alphabet
- grammatical inference
- regular languages
- path length
- tree automata
- shortest path
- shortest common supersequence
- hidden markov models
- production system
- finite automaton
- similarity measure
- databases