Skip to main content
SpringerLink
Log in

Iterated linear control and iterated one-turn pushdowns

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

For a classℒ of languages, anℒ-controlled linear grammarK consists of a linear context-free grammarG and a control languageH inℒ, where the terminals ofH are interpreted as the labels of rules ofG. The language generated byK is obtained by derivations ofG such that the corresponding strings of labels of the rules applied are control strings inH. The control of linear grammars can be iterated by starting withℒ and by taking the result of thekth step as class of control languages for the (k + 1)st step. The language class obtained by thekth step is denoted by CTRLk(ℒ). Denote byℒ(S) the language class accepted by nondeterministic one-wayS automata, whereS is a storage type. We prove that for anyS, CTRLk(ℒ(S)) = ℒ(P k1t (S)), whereP k1t (S) is the storage type the configurations of which consist ofk-iterated one-turn pushdowns ofS-configurations. We establish a strong connection between iterated linear control and iterated one-turn pushdowns. In particular, we characterize CTRL k (ℒ CF), where ℒCF is the class of context-free languages, by iterated one-turn pushdown automata in which the innermost pushdown is unrestricted.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. S. Abraham, Some questions on phrase structure grammars I,Comput. Linguist.,4 (1965), 61–70.

    Google Scholar 

  2. A. V. Aho, Indexed grammars, an extension of context-free grammars,J. Assoc. Comput. Mach.,15 (1968), 647–671.

    Google Scholar 

  3. B. Courcelle and P. Franchi-Zannettacci, Attribute grammars and recursive program schemes I, II,Theoret. Comput. Sci.,17 (1982), 163–191 andTheoret. Comput. Sci.,17 (1982), 235–257.

    Google Scholar 

  4. B. Courcelle and P. Franchi-Zannettacci, On the equivalence problem for attribute systems,Inform. and Control,52 (1982), 275–305.

    Google Scholar 

  5. W. Damm, The IO- and OI-hierarchies,Theoret. Comput. Sci.,20 (1982), 95–206.

    Google Scholar 

  6. W. Damm and A. Goerdt, An automata-theoretic characterization of the OI-hierarchy, Proc. 9th ICALP, 1982, Aarhus, pp. 141–153,Inform. and Control (to appear in 1986).

  7. J. Duske and R. Parchmann, Linear indexed languages,Theoret. Comput. Sci.,32 (1984), 47–60.

    Google Scholar 

  8. J. Engelfriet, Some open questions and recent results on tree transducers and tree languages, inFormal Language Theory; Perspectives and Open Problems (R. V. Book, ed.), Academic Press, New York, 1980.

    Google Scholar 

  9. J. Engelfriet, Recursive automata (1982), unpublished notes.

  10. J. Engelfriet, Iterated pushdown automata and complexity classes, Proc. 15th STOC, April 1983, Boston, pp. 365–373.

  11. J. Engelfriet, The ETOL hierarchy is inside the OI hierarchy, inThe Book of L (G. Rozenberg and A. Salomaa, eds.), Springer-Verlag, New York, 1986, pp. 101–109.

    Google Scholar 

  12. J. Engelfriet, G. Rozenberg, and G. Slutzki, Tree transducers, L-systems, and two-way machines,J. Comput. System Sci.,20 (1980), 150–202.

    Google Scholar 

  13. J. Engelfriet and E. M. Schmidt, IO and OI,J. Comput. System Sci.,15 (1977), 328–353 andJ. Comput. System Sci.,16 (1978), 67–99.

    Google Scholar 

  14. J. Engelfriet and G. Slutzki, Bounded nesting in macro grammars,Inform. and Control,42 (1979), 157–193.

    Google Scholar 

  15. J. Engelfriet and H. Vogler, Macro tree transducers,J. Comput. System Sci.,31 (1985), 71–146.

    Google Scholar 

  16. J. Engelfriet and H. Vogler, Regular characterizations of the macro tree transducer, inNinth Colloquium on Trees in Algebra and Programming, March 1984, Bordeaux, France (B. Courcelle, ed.), Cambridge University Press, 1984, pp. 103–117.

  17. J. Engelfriet and H. Vogler, Pushdown machines for the macro tree transducer, Technical Report 84-13, University of Leiden, The Netherlands,Theoret. Comput. Sci. (to appear in 1986).

  18. M. J. Fischer, Grammars with macro like productions, Ph.D thesis, Harvard University, 1968 (alsoProc. 9th Symp. on SWAT, 1968, pp. 131–142).

  19. S. A. Greibach, Full AFLs and nested iterated substitution,Inform. and Control,16 (1970), 7–35.

    Google Scholar 

  20. S. A. Greibach, Control sets on context-free grammar forms,J. Comput. System Sci.,15 (1977), 35–98.

    Google Scholar 

  21. S. A. Greibach, One-way finite visit automata,Theoret. Comput. Sci.,6 (1978), 175–221.

    Google Scholar 

  22. S. Ginsburg,Algebraic and Automata-Theoretic Properties of Formal Languages, North-Holland, Amsterdam, 1975.

    Google Scholar 

  23. S. Ginsburg and E. H. Spanier, Finite-turn pushdown automata,SIAM Control,3 (1966), 429–453.

    Google Scholar 

  24. S. Ginsburg and E. H. Spanier, Control sets on grammars,Math. Systems Theory,2 (1968), 159–177.

    Google Scholar 

  25. C. A. R. Hoare, Proof of correctness of data representations,Acta Inform.,1 (1972), 271–281.

    Google Scholar 

  26. T. Kasai, An hierarchy between context-free and context-sensitive languages,J. Comput. System. Sci.,4 (1970), 492–508.

    Google Scholar 

  27. N. A. Khabbaz, A geometric heirarchy of languages,J. Comput. System Sci.,8 (1974), 142–157.

    Google Scholar 

  28. N. A. Khabbaz, Control sets on linear grammars,Inform. and Control,25 (1974), 206–221.

    Google Scholar 

  29. G. Rozenberg, Selective substitution grammars (towards a framework of rewriting systems), Part 1: Definitions and Examples,Elektron. Informationsverarb. Kybernet.,13 (1977), 455–463.

    Google Scholar 

  30. D. J. Rozenkrantz, Programmed grammars and classes of formal languages,J. Assoc. Comput. Mach.,16 (1969), 107–131.

    Google Scholar 

  31. A. Salomaa,Formal Languages, Academic Press, New York, 1973.

    Google Scholar 

  32. D. Scott, Some definitional suggestions for automata theory,J. Comput. System Sci.,1 (1967), 187–212.

    Google Scholar 

  33. H. Vogler, Basic tree transducers,J. Comput. System Sci. (to appear).

  34. M. Wand, An algebraic formulation of the Chomsky-hierarchy, inCategory Theory Applied to Computation and Control, Lecture Notes in Computer Science 25, Springer-Verlag, Berlin, 1975, pp. 209–213.

    Google Scholar 

  35. J. van Leeuwen, Notes on pre-set pushdown automata, inL Systems (G. Rozenberg and A. Salomaa, eds.), Lecture Notes in Computer Science 15, Springer-Verlag, New York, 1974, pp. 177–188.

    Google Scholar 

Download references

Author information

Author notes

  1. Heiko Vogler

    Present address: Lehrstuhl fuer Informatik II, RWTH Aachen, Buechel 29-31, 5100, Aachen, Germany

Authors and Affiliations

  1. University of Leiden, P.O. Box 9512, 2300 RA, Leiden, The Netherlands

    Heiko Vogler

Authors
  1. Heiko Vogler
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The work of the author has been supported by the Netherlands Organization for the advancement of pure research (Z.W.O.).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vogler, H. Iterated linear control and iterated one-turn pushdowns. Math. Systems Theory 19, 117–133 (1986). https://doi.org/10.1007/BF01704910

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01704910

Keywords

Search

Navigation