Summary
Within the framework of coordinated pair systems a push-down automaton A is formalized as an ordered pair (G 1, G 2) of grammars, where G 1 is a right-linear grammar modelling the finite state control of A and the reading of the input of A, and G 2 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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Büchi, J.R.: Regular canonical systems. Arch. Math. Logik Grundlagenforsch. 6, 91–111 (1964)
Ehrenfeucht, E., Hoogeboom, H.J., Rozenberg, G.: On the active and full use of memory in right-boundary grammars and push-down automata. Theor. Comput. Sci. 48, 201–228 (1986)
Harrison, M.: Introduction to formal language theory, Reading, MA: Addison-Wesley 1978
Rozenberg, G.: On coordinated selective substitutions: towards a unified theory of grammars and machines. Theor. Comput. Sci. 37, 31–50 (1985)
Salomaa, A.: Formal languages, London-New York: Academic Press 1973
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ehrenfeucht, A., Hoogeboom, H.J. & Rozenberg, G. Recording the use of memory in right-boundary grammars and push-down automata. Acta Informatica 25, 203–231 (1988). https://doi.org/10.1007/BF00263585
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF00263585