Nondeterministic, probabilistic and alternating computations on cellular array models

DOI10.1016/0304-3975(95)80009-3zbMATH Open0873.68138OpenAlexW2033806449MaRDI QIDQ673634FDOQ673634

Authors: Kamala Krithivasan, Meena Mahajan 

Publication date: 28 February 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(95)80009-3

Recommendations

• scientific article; zbMATH DE number 2113944
• Non-deterministic cellular automata and languages
• Alternation on cellular automata
• scientific article; zbMATH DE number 1886323

zbMATH Keywords

cellular automaton model

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Cites Work

• Title not available (Why is that?)
• Alternation
• Title not available (Why is that?)
• On One-Way Cellular Arrays
• Systolic trellis automatata †
• One-way bounded cellular automata
• Characterizations and computational complexity of systolic trellis automata
• Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
• Real-time language recognition by one-dimensional cellular automata
• On real-time cellular automata and trellis automata
• Cellular automata complexity trade-offs
• Systolic trellis automatat†
• Relating the power of cellular arrays to their closure properties
• Title not available (Why is that?)
• Some results on time-varying and relativised cellular automata^*
• Title not available (Why is that?)
• Language classes defined by time-bounded relativised cellular automata

Cited In (2)

• Title not available (Why is that?)
• Alternation on cellular automata

This page was built for publication: Nondeterministic, probabilistic and alternating computations on cellular array models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673634)