Skip to main content
SpringerLink
Log in

Aspects of Classical Language Theory

  • Chapter
  • First Online:
Handbook of Formal Languages

Abstract

The purpose of this chapter is to give an overview on some types of grammars and families of languages arising in classical language theory and not covered elsewhere in this Handbook. Since we will discuss in this chapter a large number of topics, we cannot penetrate very deeply in any one of them. Topics very related to the ones discussed in this chapter, such as regular languages and context-free languages, have their own chapters in this Handbook, where the presentation is more detailed than in the present chapter. Among the topics covered in this chapter (Section 3 below) will also be the general theory of language families, AFL-theory. In view of the whole language theory, there is a huge number of topics possible for this chapter. It is clear that our choice of topics and the amount of detail in which each of them is presented reflect, at least to some extent, our personal tastes.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. V. Aho, “Indexed grammars - An extension to context-free grammars”, Journal of the ACM, 15 (1968) 647–671.

    MathSciNet  MATH  Google Scholar 

  2. A. V. Aho, J. D. Ullman, The Theory of Parsing,Translation, and Compiling, Prentice Hall, Engl. Cliffs, N. J., vol. I 1971, vol. II 1973.

    Google Scholar 

  3. A. V. Aho, J. D. Ullman, Principles of Compiler Design, Addison-Wesley, Reading, Mass., 1977.

    MATH  Google Scholar 

  4. R. op den Akker, B. Melichar, J. Tarhio, “The Hierarchy of LR-attributed Grammars”, in Lecture Notes in Computer Science 461, Springer-Verlag, Berlin, 1990, 13–28.

    Google Scholar 

  5. D. Angluin, “Finding Patterns Common to a Set of Strings”, 17th Symposium on Theory of Computation 1979, 130–141.

    Google Scholar 

  6. D. Angluin, “Finding Patterns Common to a Set of Strings”, Journal of Compater and System Sciences, 21 (1980) 46–62.

    MathSciNet  MATH  Google Scholar 

  7. D. Angluin, “Inductive inference of formal languages from positive data”, Information and Control, 45 (1980) 117–135.

    MathSciNet  MATH  Google Scholar 

  8. J. W. Backus, “The syntax and semantics of the proposed international algebraic language of the Zurich”, ACM-GAMM, Paris, 1959.

    MATH  Google Scholar 

  9. B. S. Baker, “Context-sensitive grammars generating context-free languages”, in Automata, Languages and Programming, M. Nivat (ed.), North-Holland, Amsterdam, 1972, 501–506.

    Google Scholar 

  10. B. S. Baker, R. V. Book, “Reversal-bounded multipushdown machines”, Journal of Computer and System Sciences, 8 (1974) 315–332.

    MathSciNet  MATH  Google Scholar 

  11. J. L. Baker, “Grammars with structured vocabulary: A model for the ALGOL 68-definition”, Information and Control, 20 (1972) 351–395.

    MathSciNet  MATH  Google Scholar 

  12. K. Barbar, “Attributed tree grammars”, Theoretical Computer Science, 119 (1993) 3–22.

    MathSciNet  MATH  Google Scholar 

  13. D. R. Bean, A. Ehrenfeucht, G. F. McNulty, “Avoidable patterns in strings of symbols”, Pacific Journal of Mathematics, 85, 2 (1979) 261–294.

    MathSciNet  MATH  Google Scholar 

  14. L. Boasson, Cônes Rationnels et Familles Agréables de Langages-Application au Langage à Compteur, Thesis, Univ. de Paris, 1971.

    Google Scholar 

  15. R. V. Book, “Terminal context in context-sensitive grammars”, SIAM Journal of Computing, 1 (1972) 20–30.

    MathSciNet  MATH  Google Scholar 

  16. J. Cassaigne, “Unavoidable binary patterns”, Acta Informatica 30 (1993) 385–395.

    MathSciNet  MATH  Google Scholar 

  17. L. M. Chirica, D. F. Martin, “An Order-Algebraic Definition of Knuthian Semantics”, Mathematical Systems Theory, 13 (1979) 1–27.

    MathSciNet  MATH  Google Scholar 

  18. N. Chomsky, “Three models for the description of language”, IRE Trans. on Information Theory, 2, 3 (1956) 113–124.

    MATH  Google Scholar 

  19. N. Chomsky, “Syntactic Structures”, Mouton, Gravenhage (1957).

    MATH  Google Scholar 

  20. N. Chomsky, “On certain formal properties of grammars”, Information and Control 2 (1959) 137–167.

    MathSciNet  MATH  Google Scholar 

  21. N. Chomsky, “Context-free grammars and pushdown storage”, M.I.T. Res. Lab. Electron. Quart. Prog.,Report 65 (1962).

    Google Scholar 

  22. N. Chomsky, “Formal properties of grammars”, Handbook of Math. Psych., Vol. 2, (1963) 323–418.

    MathSciNet  MATH  Google Scholar 

  23. A. Church, “An unsolvable problem for elementary number theory”, The American Journal of Mathematics,58 (1936) 345–363.

    MathSciNet  MATH  Google Scholar 

  24. G. Ciucar, G. Păun, “On the syntactical complexity of pure languages”, Foundations of Control Engineering, 12, 2 (1987) 69–74.

    MathSciNet  MATH  Google Scholar 

  25. S. A. Cook, “The complexity of theorem proving procedures”, Proc. Third Annual ACM Symposium on the Theory of Computing, (1971) 151–158.

    Google Scholar 

  26. B. Courcelle, P. Franchi-Zannettacci, “Attribute grammars and recursive program schemes I”, Theoretical Computer Science, 17 (1982) 163–191.

    MathSciNet  MATH  Google Scholar 

  27. B. Courcelle, P. Franchi-Zannettacci, “Attribute grammars and recursive program schemes II”, Theoretical Computer Science, 17 (1982) 235–257.

    MathSciNet  MATH  Google Scholar 

  28. K. Culik II, “A Purely Homomorphic Characterization of Recursively Enumerable Sets”, Journal of the ACM, 26, 2 (1979) 345–350.

    MathSciNet  MATH  Google Scholar 

  29. K. Culik II, F. E. Fich, A. Salomaa, “A homomorphic characterization of regular languages”, Discrete Applied Mathematics, 4 (1982) 149–152.

    MathSciNet  MATH  Google Scholar 

  30. G. Dányi, Z. Fülöp, “A note on the equivalence problem of E-patterns”, to appear in Information Processing Letters.

    Google Scholar 

  31. J. Dassow, G. Páun, A. Salomaa, “Grammars based on patterns”, International Journal of Foundations of Computer Science, 4 (1993) 1–14.

    MathSciNet  MATH  Google Scholar 

  32. M. Davis, “Unsolvable Problems”, in Handbook of Mathematical Logic, J. Bar-wise (ed.), North-Holland, Amsterdam, 1977, 567–594.

    Google Scholar 

  33. P. Dembinsky, J. Maluszynski, “Two-level grammars: CF grammars with equation schemes”, Lecture Notes in Computer Science 71, Springer-Verlag, 1979, 171–187.

    Google Scholar 

  34. P. Deransart, M. Jourdan, B. Lorho, Attribute Grammars, Lecture Notes in Computer Science 323, Springer-Verlag, 1988.

    MATH  Google Scholar 

  35. P. Deransart, M. Jourdan, (eds.) Attribute Grammars and their Applications, Lecture Notes in Computer Science 461, Springer-Verlag, 1990.

    Google Scholar 

  36. P. Deussen, “A decidability criterion for van Wijngaarden grammars”, Acta Informatica 5 (1975) 353–375.

    MathSciNet  MATH  Google Scholar 

  37. P. Deussen, K. Melhorn, “Van Wijngaarden grammars and space complexity class EXSPACE”, Acta Informatica 8 (1977) 193–199.

    MathSciNet  MATH  Google Scholar 

  38. P. Deussen, L. Wegner, “Bibliography of van Wijngaarden grammars”, Bulletin of the EATCS 6 (1978).

    Google Scholar 

  39. S. Dumitrescu, G. Păun, A. Salomaa, “Pattern languages versus parallel communicating grammar systems”, to appear.

    Google Scholar 

  40. S. Dumitrescu, G. Păun, A. Salomaa, “Languages associated to finite and infinite sets of patterns”, to appear.

    Google Scholar 

  41. J. Engelfriet, G. Rozenberg, “Fixed Point Languages, and Representation of Recursively Enumerable Languages”, Journal of the ACM, 27, 3 (1980) 499–518.

    MathSciNet  MATH  Google Scholar 

  42. A. J. Fisher, “A ”yo-yo“ parsing algorithm for a large class of van Wijngaarden grammars”, Acta Informatica 29, 6 (1992) 461–482.

    MathSciNet  MATH  Google Scholar 

  43. V. Geffert, “A representation of recursively enumerable languages by two homomorphisms and a quotient”, Theoretical Computer Science, 62 (1988) 235–249.

    MathSciNet  MATH  Google Scholar 

  44. V. Geffert, “Normal forms for phrase-structure grammars”, RAIRO Informatique théorique et Applications, 25, 5 (1991) 473–496.

    MathSciNet  MATH  Google Scholar 

  45. V. Geffert, “Tally versions of the Savitch and Immerman-Szelepcsényi theorems for sublogarithmic space”, SIAM Journal of Computing, 22, 1 (1993) 102–113.

    MathSciNet  MATH  Google Scholar 

  46. G. Georgescu, “Infinite Hierarchies of Pattern Languages”, to appear.

    Google Scholar 

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

    MATH  Google Scholar 

  48. S. Ginsburg, S. Greibach, “Mappings which preserve context-sensitive languages”, Information and Control, 9 (1966) 563–582.

    MathSciNet  MATH  Google Scholar 

  49. S. Ginsburg, S. Greibach, M. Harrison, “One-way stack automata”, Journal of the ACM, 14 (1967) 389–418.

    MathSciNet  MATH  Google Scholar 

  50. S. Ginsburg, S. Greibach, J. Hoperoft, “Studies in Abstract Families of Languages”, Memoirs of the American Mathematical Society, 87 (1969).

    Google Scholar 

  51. A. V. Gladkij, Formal Grammars and Languages, Izdatelstvo Nauka, Moscow, 1973.

    Google Scholar 

  52. I. Gorun, “A Hierarchy of Context-Sensitive Languages”, MFCS-76 Proceedings,Lecture Notes in Computer Science 45, Springer-Verlag, Berlin, 1976, 299–303.

    MATH  Google Scholar 

  53. J. A. Gougen, J. W. Thatcher, E. G. Wagner, J. B. Wright, “Initial Algebra Semantics and Continuous Algebras”, Journal of the ACM, 24, 1 (1977), 6 95.

    MathSciNet  Google Scholar 

  54. J. De Graaf, A. Ollongren, “On two-level grammars”, International Journal of Computer Mathematics 15 (1984) 269–290.

    MathSciNet  MATH  Google Scholar 

  55. S. A. Greibach, “Some restrictions on W-grammars”, International Journal of Computer and Information Science 3 (1974) 289–327.

    MathSciNet  MATH  Google Scholar 

  56. T. Harju, J. Karhumäki, H. C. M. Kleijn, “On morphic generation of regular languages”, Discrete Applied Mathematics, 15 (1986) 55–60.

    MathSciNet  MATH  Google Scholar 

  57. T. Harju, M. Penttonen, “Some decidability problems of sentential forms”, International Journal of Computer Mathematics, 7, 2 (1979) 95–107.

    MathSciNet  MATH  Google Scholar 

  58. M. Harrison, Introduction to Formal Language Theory, Addison-Wesley, Reading, Mass., 1978.

    MATH  Google Scholar 

  59. W. Hesse, “A correspondence between W-grammars and formal systems of logic”, TUM-INFO-7727, (1977).

    Google Scholar 

  60. T. Hibbard, “Scan Limited Automata and Context Limited Grammars”, Doctoral dissertation, University of California at Los Angels (1966).

    Google Scholar 

  61. J. Honkala, A. Salomaa, “How do you define the complement of a language”, Bulletin of EATCS, 20 (1983) 68–69.

    Google Scholar 

  62. J. E. Hoperoft, J. D. Ullman, Formal Languages and Their Relations to Automata, Addison-Wesley, Reading, Mass., 1969.

    Google Scholar 

  63. J. E. Hoperoft, J. D. Ullman, Introduction to Automata Theory,Languages, and Computation, Addison-Wesley, Reading, Mass., 1979.

    MATH  Google Scholar 

  64. O. Ibarra, “Reversal-bounded multicounter machines and their decision problems”, Journal of the ACM, 25 (1978) 116–133.

    MathSciNet  MATH  Google Scholar 

  65. O. Ibarra, T. Jiang, “Learning regular languages from counterexamples”, Journal of Computer and System Sciences, 2, 43 (1991) 299–316.

    MathSciNet  MATH  Google Scholar 

  66. N. Immerman, “Nondeterministic space is closed under complementation”, SIAM Journal of Computing, 17, 5 (1988) 935–938.

    MathSciNet  MATH  Google Scholar 

  67. S. Istrail, “Elementary Bounded Languages”, Information and Control, 39 (1978) 177–191.

    MathSciNet  MATH  Google Scholar 

  68. S. Istrail, “On Complements of Some Bounded Context-Sensitive Languages”, Information and Control, 42 (1979) 283–289.

    MathSciNet  MATH  Google Scholar 

  69. M. Jazayeri, W. F. Ogden, W. C. Rounds, “The Intrinsically Exponential Com-plexity of the Circularity Problem for Attribute Grammars” Communications of the ACM, 18, 12 (1975) 697–706.

    MathSciNet  MATH  Google Scholar 

  70. T. Jiang, E. Kinber, A. Salomaa, K. Salomaa, S. Yu, “Pattern languages with and without erasing”, International Journal of Computer Mathematics, 50 (1994) 147–163.

    MATH  Google Scholar 

  71. T. Jiang, A. Salomaa, K. Salomaa, S. Yu, “Inclusion is Undecidable for Patterns”, in ICALP 93 Proceedings, Lecture Notes in Computer Science 700, Springer-Verlag, Berlin, 1993, 301–312.

    Google Scholar 

  72. T. Jiang, A. Salomaa, K. Salomaa, S. Yu, “Decision Problems for Patterns”, Journal of Computer and System Sciences, 50 (1995) 53–63.

    MathSciNet  MATH  Google Scholar 

  73. N. D. Jones, “A survey of formal language theory” Technical Report 3, University of Western Ontario, Computer Science Department (1966).

    Google Scholar 

  74. N. D. Jones, “Circularity testing of attribute grammars requires exponential time: a simpler proof” Report DAIMI-PB-107, Aarhus University (1980).

    Google Scholar 

  75. L. Kari, A. Mateescu, G. Páun, A. Salomaa, “Multi-pattern languages”, Theoretical Computer Science 141 (1995) 253–268.

    MathSciNet  MATH  Google Scholar 

  76. R. M. Karp, “Reducibility among combinatorial problems”, Complexity of Computer Computations, Plenum Press, New York, (1972) 85–104.

    Google Scholar 

  77. V. Keränen, “Abelian squares can be avoided on four letters” in ICALP 92 Proceedings,Lecture Notes in Computer Science 623, Springer-Verlag, Berlin, 1992, 41–52.

    Google Scholar 

  78. D. Knuth, “Semantics of context-free languages”, Mathematical Systems Theory, 2 (1968) 127–145.

    MathSciNet  MATH  Google Scholar 

  79. D. Knuth, “Semantics of context-free languages: correction”, Mathematical Systems Theory, 5 (1971) 95–96.

    MathSciNet  MATH  Google Scholar 

  80. C. H. A. Koster, “Two-level grammars in compiler constructions, an advanced course” Lecture Notes in Computer Science 21, Springer-Verlag, Berlin, 1974, 146–156.

    Google Scholar 

  81. W. Kuich, A. Salomaa, Semirings, Automata,Languages, Springer-Verlag, Berlin, 1986.

    MATH  Google Scholar 

  82. I. Kupka, “Van Wijngaarden grammars as a special information processing model”, Lecture Notes in Computer Science 88, 1980, 367–401.

    MATH  Google Scholar 

  83. S. Y. Kuroda, “Classes of languages and linear bounded automata”, Information and Control, 7 (1964) 207–223.

    MathSciNet  MATH  Google Scholar 

  84. L. Y. Liu, P. Weiner, “An infinite hierarchy of intersections of context-free languages”, Mathematical Systems Theory, 7 (1973) 187–192.

    MathSciNet  MATH  Google Scholar 

  85. M. Latta, R. Wall, “Intersective Context-Free Languages”, 9th Congress on Natural and Formal Languages, Proceedings, C. Martin-Vide (ed), Tarragona, Spain, (1993).

    Google Scholar 

  86. M. Latteux, P. Turakainen, “On characterizations of recursively enumerable languages”, Acta Informatica 28 (1990) 179–186.

    MathSciNet  MATH  Google Scholar 

  87. J. van Leeuwen, “Recursively enumerable languages and van Wijngaarden grammars”, Indagationes Mathematicae, 39 (1977) 29–39.

    MathSciNet  MATH  Google Scholar 

  88. M. Levison, G. Lessard, “Application of Attribute Grammars to Natural Language Sentence Generation”in Lecture Notes in Computer Science 461, Springer-Verlag, Berlin, 1990, 298–312.

    Google Scholar 

  89. P. M. Lewis, D. J. Rosenkrantz, R. E. Stearns, “Attributed Translations”, Journal of Computer and System Sciences, 9 (1974) 279–307.

    MathSciNet  MATH  Google Scholar 

  90. G. S. Makanin, “The problem of solvability of equations in a free semigroup”, Matematiceskij Sbornik, 103, 145 (1977) 148–236.

    MathSciNet  MATH  Google Scholar 

  91. A. Mateescu, “Van Wijngaarden Grammars and Systems”, Ann. University of Bucharest, 2 (1988) 75–81.

    MathSciNet  MATH  Google Scholar 

  92. A. Mateescu, “Van Wijngaarden grammars and the generative complexity of recursively enumerable languages”, Ann. University of Bucharest, 2 (1989) 49–54.

    MathSciNet  MATH  Google Scholar 

  93. A. Mateescu, A. Salomaa, “Nondeterminism in patterns”, Proc. of STACS’94, Lecture Notes in Computer Science 775, Springer-Verlag, Berlin, 1994, 661–668.

    MATH  Google Scholar 

  94. A. Mateescu, A. Salomaa, “Finite Degrees of Ambiguity in Pattern Languages”, RAIRO Informatique théorique et Applications, 28, 3–4 (1994) 233–253.

    MathSciNet  MATH  Google Scholar 

  95. A. Mateescu, D. Vaida, Discrete Mathematical Structures,Applications, Publ. House of Romanian Academy, Bucharest, (1989).

    Google Scholar 

  96. G. Matthews, “A note on symmetry in phrase structure grammars”, Information and Control, 7 (1964) 360–365.

    MATH  Google Scholar 

  97. G. Matthews, “Two-way languages”, Information and Control, 10 (1967) 111–119.

    MATH  Google Scholar 

  98. H. Maurer, A. Salomaa, D. Wood, “Pure Grammars”, Information and Control, 44 (1980) 47–72.

    MathSciNet  MATH  Google Scholar 

  99. M. L. Minsky, “Recursive unsolvability of Post’s problem of ”Tag“ and other topics in theory of Turing machines”, Ann. of Math.,74 (1961) 437–455.

    MathSciNet  MATH  Google Scholar 

  100. V. Mitrana, G. Páun, G. Rozenberg, A. Salomaa, “Pattern Systems”, to appear in Theoretical Computer Science.

    Google Scholar 

  101. E. Moriya, “Associate Languages and Derivational Complexity of Formal Grammars and Languages”, Information and Control, 22 (1973) 139–162.

    MathSciNet  MATH  Google Scholar 

  102. M. Nivat, “Transduction des langages de Chomsky”, Ann. Inst. Fourier Grenoble, 18 (1968) 339–455.

    MathSciNet  MATH  Google Scholar 

  103. E. Ohlebusch, E. Ukkonen, “On the equivalence problem for E-pattern languages”, Proc. of MFCS’96,Lecture Notes in Computer Science 1113, Spribger-Verlag, Berlin, 457–468.

    Google Scholar 

  104. G. Păun, “Regular Extended H Systems are Computationally Universal”, to appear in Journal Inform. Proc. Cybern.,EIK.

    Google Scholar 

  105. G. Păun, G. Rozenberg, A. Salomaa, “Pattern Grammars”, to appear in Journal Inform. Proc. Cybern.,EIK.

    Google Scholar 

  106. M. Penttonen, “One-Sided and Two-Sided Context in Formal Grammars”, Information and Control, 25 (1974) 371–392.

    MathSciNet  MATH  Google Scholar 

  107. J. Pitt, R. J. Cunningham, “Attributed Translation and the Semantics of Natural Language”, in Lecture Notes in Computer Science 461, Springer-Verlag, Berlin, 1990, 284–297.

    Google Scholar 

  108. E. L. Post, “Finite combinatory processes-formulation I”, Journal of Symbolic Logic, 1 (1936) 103–105.

    MATH  Google Scholar 

  109. G. E. Révész, Introduction to Formal Languages, McGraw-Hill Book Comp., New York, 1980.

    Google Scholar 

  110. H. G. Rice, “Classes of recursively enumerable sets and their decision problems”, Transactions of the AMS, 89 (1953) 25–59.

    MATH  Google Scholar 

  111. H. G. Rice, “On completely recursively enumerable classes and their key arrays”, Journal of Symbolic Logic, 21 (1956) 304–341.

    MathSciNet  MATH  Google Scholar 

  112. G. Rozenberg, A. Salomaa, Cornerstones of Undecidability, Prentice Hall, New York, 1994.

    MATH  Google Scholar 

  113. A. Salomaa, Theory of Automata, Pergamon Press, 1969.

    MATH  Google Scholar 

  114. A. Salomaa, “On sentential forms of context-free grammars”, Acta Informatics,2 (1973) 40–49.

    MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

  116. A. Salomaa, Computation and Automata, Cambridge Univ. Press, Cambridge, 1985.

    MATH  Google Scholar 

  117. A. Salomaa, “The Formal Languages Column” Bulletin of EATCS, 33 (1987) 42–53.

    MATH  Google Scholar 

  118. A. Salomaa, “Pattern Languages: Problems of Decidability and Generation” Lecture Notes in Computer Science 710, Springer-Verlag, Berlin, 1993, 121–132.

    MATH  Google Scholar 

  119. A. Salomaa, “Patterns” Bulletin of EATCS, 54 (1994) 194–206.

    MATH  Google Scholar 

  120. A. Salomaa, “Patterns and Pattern Languages”, in Salodays in Auckland, Proceedings, Auckland University, (1994) 8–12.

    MATH  Google Scholar 

  121. A. Salomaa, “Return to Patterns” Bulletin of EATCS, 55 (1995) 144–157.

    MATH  Google Scholar 

  122. A. Salomaa, M. Soittola, Automata-Theoretic Aspects of Formal Power Series, Springer-Verlag, Berlin, 1978.

    MATH  Google Scholar 

  123. W. J. Savitch, “Relationships between nondeterministic and deterministic tape complexities”, Journal of Computer and System Sciences, 4, 2 (1970) 177–192.

    MathSciNet  MATH  Google Scholar 

  124. W. J. Savitch, “How to make arbitrary grammars look like context-free grammars”, SIAM Journal of Computing, 2, 3 (1973) 174–182.

    MathSciNet  MATH  Google Scholar 

  125. M. Sintzoff, “Existence of a van Wijngaarden syntax for every recursively enumerable set”, Annales Soc. Sci., Bruxelles, 81 (1967) 115–118.

    MathSciNet  Google Scholar 

  126. R. Szelepcsényi, “The Method of Forced Enumeration for Nondeterministic Automata”, Acta Informatica, 26 (1988) 279–284.

    MathSciNet  MATH  Google Scholar 

  127. M. Tătărîm, “Ackermann-Peter’s function has primitive recursive graph and range”, Found. Control Engineering, 9, 4 (1984) 177–180.

    MathSciNet  MATH  Google Scholar 

  128. A. Thue, “Uber unendliche Zeichenreihen”, Norske Vid. Selsk. Skr., I Mat. Nat. Kl., Kristiania, 7, (1906) 1–22.

    MATH  Google Scholar 

  129. A. Thue, “Uber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen”, Norske Vid. Selsk. Skr., I Mat. Nat. Kl., Kristiania, 1, (1912) 1–67.

    MATH  Google Scholar 

  130. A. Thue, “Probleme über Veränderungen von Zeichenreihen nach gegebenen Regeln.”, Skrifter utgit av Videnskapsselskapet i Kristiania I, 10, (1914) 34 pp.

    MATH  Google Scholar 

  131. P. Turakainen, “On characterization of recursively enumerable languages in terms of linear languages and VW-grammars”, Indagationes Mathematicae, 40 (1978) 145–153.

    MathSciNet  MATH  Google Scholar 

  132. P. Turakainen, “A Unified Approach to Characterizations of Recursively Enumerable Languages”, Bulletin of the EATCS, 45 (1991) 223–228.

    MATH  Google Scholar 

  133. A. M. Turing, “On computable numbers with an application to the Entscheidungsproblem”, Proc. London Math. Soc., 2, 42, (1936) 230–265. A correction, ibid., 43, 544–546.

    Google Scholar 

  134. D. A. Watt, “The parsing problem for affix grammars”, Acta Informatica, 8 (1977) 1–20.

    MATH  Google Scholar 

  135. L. M. Wegner, “On parsing two-level grammars”, Acta Informatica, 14 (1980) 175–193.

    MathSciNet  MATH  Google Scholar 

  136. A. van Wijngaarden, “Orthogonal design and description of formal languages”, Mathem. Centrum Amsterdam, 1965.

    Google Scholar 

  137. A. van Wijngaarden, “The generative power of two level grammars”, Lecture Notes in Computer Science, 14, Springer-Verlag, Berlin, 1974, 9–14.

    MATH  Google Scholar 

  138. A. van Wijngaarden(ed.), Revised report on the algorithmic language ALGOL 68, Springer-Verlag, Berlin, 1976.

    MATH  Google Scholar 

Download references

Authors
  1. Alexandru Mateescu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arto Salomaa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Leiden University, P.O. Box 9512, Leiden, RA, NL-2300, The Netherlands

    Grzegorz Rozenberg

  2. Turku Centre for Computer Science Data City, Turku, FIN-20520, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Mateescu, A., Salomaa, A. (1997). Aspects of Classical Language Theory. In: Rozenberg, G., Salomaa, A. (eds) Handbook of Formal Languages. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59136-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-59136-5_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-63863-3

  • Online ISBN: 978-3-642-59136-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation