Recording the use of memory in right-boundary grammars and push-down automata
- 32 Downloads
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.
Unable to display preview. Download preview PDF.
- 1.Büchi, J.R.: Regular canonical systems. Arch. Math. Logik Grundlagenforsch. 6, 91–111 (1964)Google Scholar
- 2.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)Google Scholar
- 3.Harrison, M.: Introduction to formal language theory, Reading, MA: Addison-Wesley 1978Google Scholar
- 4.Rozenberg, G.: On coordinated selective substitutions: towards a unified theory of grammars and machines. Theor. Comput. Sci. 37, 31–50 (1985)Google Scholar
- 5.Salomaa, A.: Formal languages, London-New York: Academic Press 1973Google Scholar