Entropy sensitivity of languages defined by infinite automata, via Markov chains with forbidden transitions.
Wilfried HussEcaterina SavaWolfgang WoessPublished in: Theor. Comput. Sci. (2010)
Keyphrases
- markov chain
- probabilistic automata
- finite state
- relative entropy
- finite automata
- regular languages
- steady state
- finite state automata
- transition probabilities
- state transition
- monte carlo
- state space
- stationary distribution
- markov process
- random walk
- monte carlo simulation
- information theory
- context free
- markov model
- stochastic process
- grammatical inference
- tree automata
- regular expressions
- information theoretic
- transition matrix
- assemble to order systems
- monte carlo method
- markov processes
- mutual information