Abstract
We conceive finite and cellular automata as dynamical systems on zero-dimensional spaces and show that they are incomparable in the sense of factorization. Next we study the complexity of languages generated by zero-dimensional systems on clopen partitions of the state space. While finite automata generate only regular languages, cellular automata generate non-deterministic polynomial languages which may be non-regular.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
