Iterative arrays with self-verifying communication cell

DOI10.1007/s11047-020-09812-4zbMath1530.68171OpenAlexW4252068708MaRDI QIDQ6195133

Martin Kutrib

Publication date: 16 February 2024

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

Full work available at URL: https://doi.org/10.1007/s11047-020-09812-4

zbMATH Keywords

decidabilityclosure propertiesself-verificationspeed-upcomputational capacityiterative arrays

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Cites Work

• Optimal simulation of self-verifying automata by deterministic automata
• Iterative tree automata
• Signals in one-dimensional cellular automata
• On strongly context-free languages
• State complexity of some operations on binary regular languages
• On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
• Iterative arrays with self-verifying communication cell
• Real-time language recognition by one-dimensional cellular automata
• Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
• On One-Way Cellular Arrays
• One-way bounded cellular automata
• Real-time computations with restricted nondeterminism
• Nondeterministic Communication with a Limited Number of Advice Bits
• Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations
• Self-Verifying Pushdown and Queue Automata
• Complexity of One-Way Cellular Automata
• Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item