Graphs Related to Reversibility and Complexity in Cellular Automata

DOI10.1007/978-1-4939-8700-9_677zbMath1484.37027OpenAlexW4231763170MaRDI QIDQ5072509

Genaro J. Martínez, Juan Carlos Seck-Tuoh-Mora

Publication date: 28 April 2022

Published in: Cellular Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4939-8700-9_677

Mathematics Subject Classification ID

Applications of graph theory (05C90) Dynamical aspects of cellular automata (37B15)

Related Items (2)

Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\) ⋮ Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata

This page was built for publication: Graphs Related to Reversibility and Complexity in Cellular Automata