Breaking up Finite Automata Presentable torsion-Free Abelian Groups.

Gábor Braun Lutz Strüngmann

Published in: Int. J. Algebra Comput. (2011)

Keyphrases

production system
finite automata
regular expressions
deterministic automata
grammatical inference
probabilistic automata
expert systems
tree automata
regular languages
finite automaton
hidden markov models
machine learning
pattern matching
high throughput