Login / Signup
Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet.
Jozef Jirásek
Galina Jirásková
Alexander Szabari
Published in:
Developments in Language Theory (2007)
Keyphrases
</>
finite automata
deterministic automata
regular expressions
probabilistic automata
grammatical inference
tree automata
finite automaton
hidden markov models
regular languages
machine learning
domain specific
language learning
fully observable