Entropy sensitivity of languages defined by infinite automata, via Markov chains with forbidden transitions
type: Item
instance of: scholarly article
title: Entropy sensitivity of languages defined by infinite automata, via Markov chains with forbidden transitions
zbMATH Open document ID: 1234.68212
author: Wilfried Huss
author: Wolfgang Woess
author: Ecaterina Sava
published in: Theoretical Computer Science
publication date: 2012-04-03T00:00:00Z
full work available at URL: https://arxiv.org/abs/0911.0142
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6021249
zbMATH Keywords: formal language
zbMATH Keywords: oriented graph
zbMATH Keywords: infinite sofic system
zbMATH Keywords: growth sensitivity
zbMATH Keywords: entropy
zbMATH Keywords: irreducible Markov chain
zbMATH Keywords: spectral radius
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W1969973623
arXiv ID: 0911.0142
cites work: Growth tightness for word hyperbolic groups.
cites work: Q3653240
cites work: Almost isomorphism for countable state Markov shifts
cites work: Q3155223
cites work: Growth and ergodicity of context-free languages II: The linear case
cites work: Growth and ergodicity of context-free languages
cites work: Growth-sensitivity of context-free languages.
cites work: Context-free pairs of groups. I: Context-free pairs and graphs
cites work: On problems related to growth, entropy, and spectrum in group theory
cites work: Q5590503
cites work: An Introduction to Symbolic Dynamics and Coding
cites work: Groups, the theory of ends, and context-free languages
cites work: The theory of ends, pushdown automata, and second-order logic
cites work: Chains, entropy, coding
cites work: Eigenvalues of Non-Negative Matrices
cites work: Non-negative matrices and Markov chains.
DOI: 10.1016/J.TCS.2010.07.020
description: scientific article; zbMATH DE number 6021249