Abstract
This paper discusses real-time language recognition by one-dimensional cellular automata (CA), focusing on limitations of the parallel recognition power. We investigate language recognition of strings containing binary representations B ( | w | ) of their own lengths. It is shown that: (1) The language L X = { w ∈ { 0 , 1 } + : w contains the binary number(s) B ( | w | ) } is recognizable by CA in linear time, but is not recognizable in real time; and (2) The class of languages that are recognizable by CA in real time is not closed under concatenation and not closed under reversal. These results are solutions to the problems posed by Smith III in [A.R. Smith III, Real-time language recognition by one-dimensional cellular automata, J. Comput. System Sci. 6 (1972) 233–253].
Sign-in/Register to access full text options 
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.
