Login / Signup
State complexity of operations on two-way finite automata over a unary alphabet.
Michal Kunc
Alexander Okhotin
Published in:
Theor. Comput. Sci. (2012)
Keyphrases
</>
finite automata
deterministic automata
grammatical inference
probabilistic automata
regular expressions
pairwise
regular languages
tree automata
query language
finite automaton
machine learning
semi automatic
decision problems