On 'forgetful' cellular automata

DOI10.1016/S0022-0000(75)80070-5zbMath0329.94026OpenAlexW2092283928MaRDI QIDQ1227707

K. Appert

Publication date: 1975

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(75)80070-5

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items

On time reduction and simulation in cellular spaces ⋮ Nature-Based Problems in Cellular Automata

Cites Work

• Unnamed Item
• On Turing machines with variable structure
• Real-time language recognition by one-dimensional cellular automata
• An 8-state minimal time solution to the firing squad synchronization problem
• On finite automata with a time-variant structure
• Simple Computation-Universal Cellular Spaces
• Cellular automata complexity trade-offs

This page was built for publication: On 'forgetful' cellular automata