Abstract
Within the framework of coordinated pair systems a push-down automaton A is formalized as an ordered pair (G1, G2) of grammars, where G1 is a right-linear grammar modelling the finite state control of A and the reading of the input of A, and G2 is a right-boundary grammar modelling the push-down store of A. In this paper we present a systematic investigation into the use of memory of right-boundary grammars. Various methods of recording the use of memory are introduced. The results presented concern regularity properties of each of the methods and the interrelationships of the records obtained by different methods. Finally the translation of these results to the level of push-down automata (coordinated pair systems) is discussed.
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.
