Alternation on cellular automata

DOI10.1016/S0304-3975(96)00214-9zbMath0901.68137MaRDI QIDQ1390871

Martin Matamala

Publication date: 22 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

cellular automatanondeterminismalternationalternating Turing machines

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items

Non-deterministic cellular automata and languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nondeterministic, probabilistic and alternating computations on cellular array models
• A linear speed-up theorem for cellular automata
• Real-time language recognition by one-dimensional cellular automata
• On One-Way Cellular Arrays
• Alternation
• Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines