On the Length of Shortest Strings Accepted by Two-Way Finite Automata.

Egor Dobronravov Nikita Dobronravov Alexander Okhotin

Published in: DLT (2019)

Keyphrases

finite automata
longest common subsequence
grammatical inference
regular expressions
probabilistic automata
path length
regular languages
deterministic automata
shortest path
finite alphabet
tree automata
shortest common supersequence
finite automaton
hidden markov models