Abstract
This paper investigates the power of realtime one-way synchronized alternating one-counter automata (1saca (1, real)s), and shows that (1) 1saca(1, real)s are more powerful than real-time one-way nondeterministic multicounter automata, and (2) there exist a language accepted by a 1saca(1, real), but not accepted by any realtime one-way alternating multi-stack-counter automata. As a corollary of (2), we have: for each k ⩾ 1, realtime one-way synchronized alternating k-counter ( k-stack-counter) automata are more powerful than realtime one-way alternating k-counter ( k-stack-counter) automata. We, finally, show that realtime synchronized alternating finite automata recognize exactly regular sets, i.e., that one counter is more powerful than no counter for realtime synchronized alternating 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 callSimilar Papers
Disclaimer: 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.
