Login / Signup
The maximum length of shortest accepted strings for direction-determinate two-way finite automata.
Olga Martynova
Alexander Okhotin
Published in:
CoRR (2022)
Keyphrases
</>
finite automata
longest common subsequence
maximum number
grammatical inference
probabilistic automata
regular expressions
deterministic automata
path length
regular languages
shortest common supersequence
finite alphabet
shortest path
tree automata
finite automaton
hidden markov models
object oriented