Entropy sensitivity of languages defined by infinite automata, via Markov chains with forbidden transitions

DOI10.1016/j.tcs.2010.07.020zbMath1234.68212arXiv0911.0142OpenAlexW1969973623MaRDI QIDQ410708

Wilfried Huss, Wolfgang Woess, Ecaterina Sava-Huss

Publication date: 3 April 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0911.0142

zbMATH Keywords

entropyspectral radiusoriented graphformal languagegrowth sensitivityinfinite sofic systemirreducible Markov chain

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Growth tight actions of product groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Context-free pairs of groups. I: Context-free pairs and graphs
• Groups, the theory of ends, and context-free languages
• The theory of ends, pushdown automata, and second-order logic
• Growth-sensitivity of context-free languages.
• Growth tightness for word hyperbolic groups.
• On problems related to growth, entropy, and spectrum in group theory
• Non-negative matrices and Markov chains.
• Growth and ergodicity of context-free languages
• Almost isomorphism for countable state Markov shifts
• Growth and ergodicity of context-free languages II: The linear case
• Chains, entropy, coding
• An Introduction to Symbolic Dynamics and Coding
• Eigenvalues of Non-Negative Matrices