Regularity of One-Letter Languages Acceptable by 2-Way Finite Probabilistic Automata.

Published in: FCT (1991)

Keyphrases

probabilistic automata
finite automata
grammatical inference
regular languages
finite state automata
markov chain
relative entropy
regular expressions
sound theoretical
inductive inference
databases
hidden markov models
context free
database systems
nearest neighbor
context free grammars