scientific article; zbMATH DE number 5279366
From MaRDI portal
Publication:5387668
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Dynamical aspects of cellular automata (37B15) Decidability of theories and sets of sentences (03B25) Topological entropy (37B40) Symbolic dynamics (37B10)
Related Items
Observation of nonlinear systems via finite capacity channels: constructive data rate limits ⋮ Computability of topological pressure on compact shift spaces beyond finite type* ⋮ Beta-shifts, their languages, and computability ⋮ Computability of entropy and information in classical Hamiltonian systems ⋮ Effect of quantified irreducibility on the computability of subshift entropy ⋮ Computing the Topological Entropy of Shifts ⋮ A characterization of the entropies of multidimensional shifts of finite type ⋮ Regular Language Distance and Entropy ⋮ On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts
