Some results on time-varying and relativised cellular automata*
From MaRDI portal
Publication:4016899
DOI10.1080/00207169208804070zbMath0761.68068OpenAlexW2003246942MaRDI QIDQ4016899
Meena Mahajan, Kamala Krithivasan
Publication date: 16 January 1993
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169208804070
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Language classes defined by time-bounded relativised cellular automata ⋮ Nondeterministic, probabilistic and alternating computations on cellular array models ⋮ Non-deterministic cellular automata and languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On real-time cellular automata and trellis automata
- Relating the power of cellular arrays to their closure properties
- Real-time language recognition by one-dimensional cellular automata
- Terminal weighted grammars and picture description
- Time varying finite automata
- Time varying pushdown automata
- Indecomposable local maps of tessellation automata
- One-way bounded cellular automata
- On Some Open Problems in the Theory of Cellular Automata
- Cellular automata complexity trade-offs
This page was built for publication: Some results on time-varying and relativised cellular automata*
