Determination of finite automata accepting subregular languages.

Henning Bordihn Markus Holzer Martin Kutrib

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

Keyphrases

finite automata
grammatical inference
regular languages
deterministic automata
probabilistic automata
regular expressions
context free
tree automata
inductive inference
finite automaton
pattern languages
databases
semi automatic
query language
hidden markov models
high level
data mining