On time computability of functions in one-way cellular automata
From MaRDI portal
Publication:1130159
DOI10.1007/S002360050123zbMath0903.68128OpenAlexW2072713114MaRDI QIDQ1130159
Thomas Buchholz, Martin Kutrib
Publication date: 20 August 1998
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: http://geb.uni-giessen.de/geb/volltexte/1998/18/
Related Items (14)
Conjunctive and Boolean grammars: the true general case of the context-free grammars ⋮ Self-verifying Cellular Automata ⋮ Fast one-way cellular automata. ⋮ Shrinking one-way cellular automata ⋮ \(\mathrm{GF}(2)\)-operations on basic families of formal languages ⋮ Cellular automata with sparse communication ⋮ The Boolean closure of linear context-free languages ⋮ On hardest languages for one-dimensional cellular automata ⋮ On hardest languages for one-dimensional cellular automata ⋮ Constructible functions in cellular automata and their applications to hierarchy results ⋮ Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities ⋮ Simulation of one-way cellular automata by Boolean circuits ⋮ Complexity of One-Way Cellular Automata ⋮ Non-deterministic cellular automata and languages
This page was built for publication: On time computability of functions in one-way cellular automata
