Publication:5387668
From MaRDI portal
zbMath1153.37320MaRDI QIDQ5387668
Publication date: 27 May 2008
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/issue/view/82/showToc.html
68Q45: Formal languages and automata
37B15: Dynamical aspects of cellular automata
03B25: Decidability of theories and sets of sentences
37B40: Topological entropy
37B10: Symbolic dynamics
Related Items
Computing the Topological Entropy of Shifts, Computability of topological pressure on compact shift spaces beyond finite type*, Regular Language Distance and Entropy, Observation of nonlinear systems via finite capacity channels: constructive data rate limits, Beta-shifts, their languages, and computability, Computability of entropy and information in classical Hamiltonian systems, A characterization of the entropies of multidimensional shifts of finite type, On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts, Effect of quantified irreducibility on the computability of subshift entropy