Entropy sensitivity of languages defined by infinite automata, via Markov chains with forbidden transitions
Wilfried HussEcaterina SavaWolfgang WoessPublished in: CoRR (2009)
Keyphrases
- markov chain
- probabilistic automata
- finite state
- relative entropy
- regular languages
- finite automata
- steady state
- transition probabilities
- finite state automata
- monte carlo method
- stationary distribution
- markov processes
- grammatical inference
- state transition
- state space
- markov model
- random walk
- markov process
- monte carlo simulation
- monte carlo
- stochastic process
- regular expressions
- context free
- information theory
- transition matrix
- machine learning
- finite state machines
- markov decision processes
- pattern matching
- random numbers
- weighted sums