Abstract
On Cellular Automata with a Finite Number of State Changes. The number of state changes is introduced as a complexity measure for the recognition of languages in cellular automata. The relation of the simplest class — i.e. the one with a constant number of changes per single automaton — to the Chomsky hierarchy is investigated and a comparison with sequential tape complexity is made.KeywordsCellular AutomatonTuring MachineRegular LanguagePropagation SectionLeft BorderThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
