On the Relationship between Complexity and Entropy for Markov Chains and Regular Languages.
Wentian LiPublished in: Complex Syst. (1991)
Keyphrases
- markov chain
- regular languages
- finite automata
- probabilistic automata
- grammatical inference
- finite state
- decision problems
- transition probabilities
- context free languages
- regular expressions
- markov processes
- state space
- computational complexity
- worst case
- information theoretic
- pac learning
- mutual information
- transition matrix
- special case
- markov decision processes