On a class of languages recognizable by probabilistic reversible decide-and-halt automata.
Marats GolovkinsMaksim KravtsevVasilijs KravcevsPublished in: Theor. Comput. Sci. (2009)
Keyphrases
- finite automata
- regular languages
- cellular automata
- grammatical inference
- probabilistic automata
- bayesian networks
- markov chain
- regular expressions
- expressive power
- context free
- parametric family
- discrete valued
- rational kernels
- neural network
- linear separability
- turing machine
- language identification
- prior probabilities
- probabilistic logic
- pattern languages
- language independent
- cross lingual
- reinforcement learning