Abstract
Deterministic 1-way stack automata (SA) are generalized to include jumps, and it is established that for any SA there exists an equivalent semi-real-time Jump SA. Applying a well-known information theoretic argument to the Jump SA, we prove that certain languages cannot be SA languages. Parallel to Cole's treatment ( J. Assoc. Comput. Mach. (1971), 306–328) of pushdown automata, we show that SA's can be reduced to real-time n -dimensional cellular automata.
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.
