Deciding unique decodability of bigram counts via finite automata.

Aryeh Kontorovich Ari Trachtenberg

Published in: J. Comput. Syst. Sci. (2014)

Keyphrases

finite automata
probabilistic automata
deterministic automata
regular expressions
grammatical inference
tree automata
language model
n gram
hidden markov models
finite automaton
machine learning
expert systems
probabilistic model
semi automatic