Shrinking one-way cellular automata

DOI10.1007/s11047-016-9588-8zbMath1530.68174MaRDI QIDQ6191203

Martin Kutrib, Andreas Malcher, Matthias Wendlandt

Publication date: 9 February 2024

Published in: Natural Computing (Search for Journal in Brave)

zbMATH Keywords

computational capacityiterative arrayslanguage theoryone-way cellular automatadissolving cellshierarchies of language classes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast language acceptance by shrinking cellular automata
• On time computability of functions in one-way cellular automata
• Fault tolerant cellular spaces
• Fault tolerant cellular automata
• Signals in one-dimensional cellular automata
• Fast one-way cellular automata.
• Non-deterministic cellular automata and languages
• Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages
• Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
• One-way bounded cellular automata
• Real-time computations with restricted nondeterminism
• Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
• Generation of Primes by a One-Dimensional Real-Time Iterative Array

This page was built for publication: Shrinking one-way cellular automata