Login / Signup
Results on the Average State and Transition Complexity of Finite Automata Accepting Finite Languages (Extended Abstract).
Hermann Gruber
Markus Holzer
Published in:
DCFS (2006)
Keyphrases
</>
extended abstract
finite automata
grammatical inference
deterministic automata
regular languages
probabilistic automata
regular expressions
tree automata
expressive power
finite automaton
databases
knowledge base
information extraction
pattern matching
inductive inference
state transition