Bideterministic automata and minimal representations of regular languages.

Hellis Tamm Esko Ukkonen

Published in: Theor. Comput. Sci. (2004)

Keyphrases

regular languages
regular expressions
finite automata
grammatical inference
context free languages
decision problems
finite state automata
positive data
pac learning
context free grammars
finite state machines
context free
pattern matching
query language
statistical queries
special case
hidden markov models