Automata, Languages and Programming

DOI10.1007/11523468zbMath1082.68072OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716793

Jarkko Kari, Eugen Czeizler

Publication date: 10 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items

A tight linear bound on the synchronization delay of bijective automata ⋮ Real-time reversible iterative arrays ⋮ Bounds on Non-surjective Cellular Automata ⋮ Inverse rules of ECA with rule number 150 ⋮ Fast reversible language recognition using cellular automata ⋮ Theory of cellular automata: a survey ⋮ Linear Algebra Based Bounds for One-Dimensional Cellular Automata ⋮ Welch sets for random generation and representation of reversible one-dimensional cellular automata ⋮ Reversibility of number-conserving 1D cellular automata: unlocking insights into the dynamics for larger state sets ⋮ Real-Time Reversible One-Way Cellular Automata