On time-constructible functions in one-dimensional cellular automata

DOI10.1007/3-540-48321-7_26MaRDI QIDQ4934340zbMATH OpenFDO

Authors C. Iwamoto, Tomonobu Hatsuyama, Katsunobu Imai, Kenichi Morita

Publication date 17 January 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48321-7_26

zbMATH Keywords

cellular automata

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• Constructible functions in cellular automata and their applications to hierarchy results
• On time computability of functions in one-way cellular automata
• A Time Hierarchy Theorem for Nondeterministic Cellular Automata
• Fast one-way cellular automata.
• On proving time constructibility of functions

Cited in

(5)

• On proving time constructibility of functions
• On time computability of functions in one-way cellular automata
• A Time Hierarchy Theorem for Nondeterministic Cellular Automata
• Cellular automata with limited inter-cell bandwidth
• Constructible functions in cellular automata and their applications to hierarchy results

This page was built for publication: On time-constructible functions in one-dimensional cellular automata

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