Zero-dimensional dynamical systems, formal languages, and universality

DOI10.1007/s002240000124zbMath0934.68053OpenAlexW2010513324MaRDI QIDQ1293548

Petr Kůrka

Publication date: 28 June 1999

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002240000124

zbMATH Keywords

complexity of formal languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Universal computation and other capabilities of hybrid and continuous dynamical systems, Computational complexity of dynamical systems: the case of cellular automata, TRANSITIVE BEHAVIOR IN REVERSIBLE ONE-DIMENSIONAL CELLULAR AUTOMATA WITH A WELCH INDEX 1, Characterization of 1-d Periodic Boundary Reversible CA, Language complexity of rotations and Sturmian sequences