Login / Signup
Two-way deterministic automata with two reversals are exponentially more succinct than with one reversal.
Marcin Balcerzak
Damian Niwinski
Published in:
Inf. Process. Lett. (2010)
Keyphrases
</>
deterministic automata
finite automata
decision trees
training data
computational model
grammatical inference