Nondeterministic, probabilistic and alternating computations on cellular array models
From MaRDI portal
Publication:673634
DOI10.1016/0304-3975(95)80009-3zbMath0873.68138OpenAlexW2033806449MaRDI QIDQ673634
Meena Mahajan, Kamala Krithivasan
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
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On real-time cellular automata and trellis automata
- Characterizations and computational complexity of systolic trellis automata
- Relating the power of cellular arrays to their closure properties
- Real-time language recognition by one-dimensional cellular automata
- Systolic trellis automatata †
- Systolic trellis automatat†
- Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
- On One-Way Cellular Arrays
- One-way bounded cellular automata
- Alternation
- Some results on time-varying and relativised cellular automata*
- Language classes defined by time-bounded relativised cellular automata
- Cellular automata complexity trade-offs
This page was built for publication: Nondeterministic, probabilistic and alternating computations on cellular array models
