Skip to main content
SpringerLink
Log in

Theory of formal grammars

  • Published:
Journal of Soviet Mathematics Aims and scope Submit manuscript

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.

Institutional subscriptions

Literature cited

  1. Ya. M. Barzdin', “Complexity of symmetry recognition on Turing machines,” in: Problems in Cybernetics [in Russian], No. 15, Nauka, Moscow (1965), pp. 245–248.

    Google Scholar 

  2. L. A. Bassalygo and E. V. Paducheva, “Structural functionals of a context-free grammar and estimation of the complexity of a derivation,” Nauch.-Tekh. Inform. Sborn. Vsesoyuz. Inst. Nauch. i Tekh. Inform., Ser. 2, No. 2, 28–32 (1970).

    Google Scholar 

  3. M. I. Beletskii, “Context-free and dominancy grammars and related algorithmic problems,” Kibernetika, No. 4, 90–97 (1967).

    Google Scholar 

  4. M. I. Beletskii, “Strong equivalence of categorical and dominancy grammars,” Kibernetika, No. 3, 92–93 (1968).

    Google Scholar 

  5. M. I. Beletskii, “On the various types of equivalence between dominancy grammars,” Kibernetika, No. 4, 91–95 (1968).

    Google Scholar 

  6. M. I. Beletskii, “Relationship between categorical and dominancy grammars (I),” Kibernetika, No. 4, 129–135 (1969).

    Google Scholar 

  7. M. I. Beletskii, “Relationship between categorical and dominancy grammars (II),” Kibernetika, No. 5, 10–14 (1969).

    Google Scholar 

  8. V. B. Borshchev, “Neighborhood grammars,” Nauch.-Tekh. Inform. Sborn., Vsesoyuz. Inst. Nauch. i Tekh. Inform., Ser. 2, No. 11, 39–41 (1967).

    Google Scholar 

  9. V. B. Borshchev and M. V. Khomyakov, “Neighborhood grammars and translation models. Part I: Neighborhood grammars,” Nauch.-Tekh. Inform. Sborn. Vsesoyuz. Inst. Nauch. i Tekh. Inform., Ser. 2, No. 3, 39–44 (1970).

    Google Scholar 

  10. M. K. Valiev and A. Ya. Dikovskii, “Hierarchies of CF languages according to their recognition times,” Abstracts of All-Union Sci. Conf. Structuromathematical Methods for the Modeling of Languages [in Russian], Part I, Kiev (1970), pp. 25–26.

  11. A. V. Gladkii, “On the complexity of derivations in immediate-constituent grammars,” Algebra i Logika,3, Nos. 5–6, 29–44 (1964).

    Google Scholar 

  12. A. V. Gladkii, Lectures in Mathematical Linguistics for University Students [in Russian], Novosibirsk (1966).

  13. A. V. Gladkii, “Signed neighborhood grammars and CS grammars,” Nauch.-Tekh. Inform. Sborn. Vsesoyuz. Inst. Nauch. i Tekh. Inform., Ser. 2, No. 5, 22–24 (1969).

    Google Scholar 

  14. A. V. Gladkii and A. Ya. Dikovskii, “Theory of formal grammars and languages,” Proc. Second All-Union Conf. Programming [in Russian], Sec. K, Novosibirsk (1970), pp. 43–70.

  15. A. V. Gladkii and I. A. Mel'chuk, “Tree grammars. Part I: An experiment in the formalization of transformations of the syntactical structures of natural language,” in: Informational Aspects of Semiotics, Linguistics, and Automatic Translation [in Russian], No. 1, Moscow (1971), pp. 16–41.

    Google Scholar 

  16. A. Ya. Dikovskii, “Relationship between the class of all context-free languages and the class of deterministic context-free languages,” Algebra i Logika,8, No. 1, 44–64 (1969).

    Google Scholar 

  17. A. Ya. Dikovskii, “Remark on deterministic linear languages,” in: Problems in Cybernetics [in Russian], No. 23, Nauka, Moscow (1970), pp. 281–286.

    Google Scholar 

  18. A. Ya. Dikovskii, “Languages of finite index,” Dokl. Akad. Nauk SSSR,192, No. 5, 966–968 (1970).

    Google Scholar 

  19. A. Ya. Dikovskii, “Density: a measure of derivation complexity in a context-free grammar,” Probl. Peredachi Inform.,8, No. 2, 90–102 (1972).

    Google Scholar 

  20. A. Ya. Dikovskii and L. S. Modina, “Minimization of a particular complexity function in the class of pushdown automata; categorical grammars of complexity three,” Algebra i Logika,7, No. 3, 23–37 (1968).

    Google Scholar 

  21. G. P. Kozhevnikova, “Computational complexity of the syntax-directed translations of a certain grammar,” in: Automata Theory (Seminar Proceedings) [in Russian], No. 5, Kiev (1969), pp. 67–84.

    Google Scholar 

  22. T. D. Korel'skaya and E. V. Paducheva, Formal Apparatus of Syntax-Directed Transductions, PGÉPL Prepublications [in Russian], No. 10, Moscow (1970).

  23. O. S. Kulagina, Problems in the Transformation of Subordination Trees, Preprint No. 12 [in Russian], Inst. Prikl. Matem. Akad. Nauk SSSR, Moscow (1969).

    Google Scholar 

  24. A. A. Letichevskii, “Syntax and semantics of formal languages,” Kibernetika, No. 4, 1–9 (1968).

    Google Scholar 

  25. A. A. Letichevskii, “Relations representable in pushdown automata,” Kibernetika, No. 1, 1–7 (1969).

    Google Scholar 

  26. M. V. Lomkovskaya, “Signed neighborhood and context-free languages,” Nauch.-Tekh. Inform. Sborn. Vsesoyuz. Inst. Nauch. i Tekh. Inform., Ser. 2, No. 6, 21–24 (1969).

    Google Scholar 

  27. M. V. Lomkovskaya, “Recognition of metalinear languages by the method of T. Kasami, in: Problems in Mathematical Logic [in Russian], Mir, Moscow (1970), pp. 369–371.

    Google Scholar 

  28. M. V. Lomkovskaya, “Certain properties of k-conditional grammars,” Nauch.-Tekh. Inform. Sborn. Vsesoyuz. Inst. Nauch. i Tekh, Inform., Ser. 2, No. 1, 1–21 (1972).

    Google Scholar 

  29. M. V. Lomkovskaya, “On k-conditional and other commutative grammars,” Nauch.-Tekh. Inform. Sborn. Vsesoyuz. Inst. Nauch. i Tekh. Inform., Ser. 2, No. 2, 28–31 (1972).

    Google Scholar 

  30. V. Yu. Meitus, “Properties of synchronized grammars (I),” in: Theory of Cybernetics [in Russian], No. 1, Kiev (1970), pp. 30–43.

    Google Scholar 

  31. L. S. Modina, “Extended tree languages,” Abstracts All-Union Sci. Conf. Structuromathematical Methods for the Modeling of Languages [in Russian], Part II, Kiev (1970), pp. 91–92.

  32. V. A. Nepomnyashchii, “Rudimentary interpretation of two-tape Turing computations,” Kibernetika, No. 2, 29–35 (1970).

    Google Scholar 

  33. V. N. Porshneva, “A class of deterministic automata,” in: Automata Theory (Seminar Proceedings) [in Russian], No. 5, Kiev (1969), pp. 40–50.

    Google Scholar 

  34. V. N. Porshneva, “Unambiguous grammars,” in: Automata Theory (Seminar Proceedings) [in Russian], No. 5, Kiev (1969), pp. 51–66.

    Google Scholar 

  35. V. N. Red'ko, “On the language parsing problem (I),” Kibernetika, No. 1, 61–67 (1969).

    Google Scholar 

  36. V. N. Red'ko, “On the language parsing problem (II),” Kibernetika, No. 3, 52–57 (1969).

    Google Scholar 

  37. V. N. Red'ko, “Parametric grammars and the language parsing problem,” Proc. Second All-Union Conf. Programming [in Russian], Sec. K, Novosibirsk (1970), pp. 3–19.

  38. L. G. Samoilenko, “A class of immediate-constituent grammars,” Kibernetika, No. 2, 102–103 (1968).

    Google Scholar 

  39. É. D. Stotskii, “Restrictions on the derivation scheme in immediate-constituent grammars,” Nauch.-Tekh. Inform. Sborn. Vsesoyuz. Inst. Nauch. i Tekh. Inform., Ser. 2, No. 7, 35–38 (1967).

    Google Scholar 

  40. É. D. Stotskii, “Generative grammars and derivation control,” Nauch.-Tekh. Inform. Sborn. Vsesoyuz. Inst. Nauch. i Tekh. Inform., Ser. 2, No. 10, 28–31 (1968).

    Google Scholar 

  41. É. D. Stotskii, “The index concept in generalized grammars,” Nauch.-Tekh. Inform. Sborn. Vsesoyuz. Inst. Nauch. i Tekh. Inform., Ser. 2, No. 5, 16–17 (1969).

    Google Scholar 

  42. É. D. Stotskii, “Formal grammars and derivation restrictions,” Probl. Peredachi Inform.,7, No. 1, 87–101 (1971).

    Google Scholar 

  43. É. D. Stotskii, “Derivation control in formal grammars,” Probl. Peredachi Inform.,7, No. 3, 87–102 (1971).

    Google Scholar 

  44. S. Ya. Fitialov, “Equivalence of CS grammars and dependency grammars,” in: Problems in Structural Linguistics 1967 [in Russian], Nauka, Moscow (1968), pp. 71–102.

    Google Scholar 

  45. A. L. Fuksman, “Certain grammars for the description of context-free languages,” First All-Union Conf. Programming. A: Aspects of Programming Theory [in Russian], Kiev (1968), pp. 135–143.

  46. A. L. Fuksman, “Parsing algorithms for certain classes of languages,” in: Application of Computer Mathematical and Computer Engineering Methods for the Solution of Scientific-Research and National-Economic Problems [in Russian], No. 4, Voronezh (1969), pp. 61–64.

    Google Scholar 

  47. A. L. Fuksman, “Grammars for the description of context-free languages,” in: Programming Automation (Seminar Proceedings) [in Russian], No. 1, Kiev (1969), pp. 36–70.

    Google Scholar 

  48. A. L. Fuksman, “Some properties of formal grammars,” Proc. Second All-Union Conf. Programming [in Russian], Sec. K, Novosibirsk (1970), pp. 21–31.

  49. M. M. Kherts, “Entropy of languages generated by automaton or contex-free grammars with unambiguous derivation,” Nauch.-Tekh. Inform. Sborn. Vsesoyuz. Inst. Nauch. i Tekh. Inform., Ser. 2, No. 1, 29–34 (1968).

    Google Scholar 

  50. M. V. Khomyakov, “Neighborhood grammars and translation models,” Nauch.-Tekh. Inform. Sborn. Vsesoyuz. Inst. Nauch. i Tekh. Inform., Ser. 2, No. 4, 38–40 (1970).

    Google Scholar 

  51. M. V. Khomyakov, “Neighborhood translations and invariant relations,” Nauch.-Tekh. Inform. Sborn. Vsesoyuz. Inst. Nauch. i Tekh, Inform., Ser. 2, No. 8, 38–40 (1970).

    Google Scholar 

  52. Yu. A. Shreider, “A neighborhood model of language,” Uch. Zap. Tartu. Univ., No. 226, 129–142 (1969).

    Google Scholar 

  53. S. Abraham, “Some questions of phrase structure grammars (I),” Comput. Lingust.,4, 61–70 (1965).

    Google Scholar 

  54. A. V. Aho, “Indexed grammars-an extension of context-free grammars,” J. Assoc. Computing Mach.,15, No. 4, 647–671 (1968).

    Google Scholar 

  55. A. V. Aho, “Nested stack automata,” J. Assoc. Computing Mach.,16, No. 3, 383–406 (1969).

    Google Scholar 

  56. A. V. Aho and J. D. Ullman, “Automaton analogs of syntax-directed translation schemata,” Proc. Ninth Ann. Sympos. Switching and Automata Theory (1968).

  57. A. V. Aho and J. D. Ullman, “The theory of languages,” Math. Syst. Theory,2, No. 2, 97–125 (1968).

    Google Scholar 

  58. A. V. Aho and J. D. Ullman, “Syntax-directed translations and the pushdown assembler,” J. Comput. Syst. Sci.,3, No. 1, 37–56 (1969).

    Google Scholar 

  59. A. V. Aho and J. D. Ullman, “Properties of syntax-directed translations,” J. Comput. Syst. Sci.,3, No. 3, 319–334 (1969).

    Google Scholar 

  60. Setsuo Arikawa, “Elementary formal systems and formal languages; simple formal systems,” Mem. Fac. Sci. Kyushu Univ.,A24, No. 1, 47–75 (1970).

    Google Scholar 

  61. A. Birman and J. D. Ullman, “Parsing algorithms with backtrack,” IEEE Conf. Rec. Eleventh Ann. Sympos. Switching and Automata Theory, New York (1970), pp. 153–174.

  62. R. V. Book, “On the notion of the bounding functions for grammars,” Mathematical Lingustics and Automatic Translation, Harvard Univ. Comput. Lab. Rep. NSF-18, Cambridge, Mass (1967), (III-1)–(III-15).

    Google Scholar 

  63. R. V. Book, “Grammars with time functions,” Mathematical Linguistics and Automatic Translation, Harvard Univ. Comput. Lab. Rep. NSF-23, Cambridge, Mass. (1969).

    Google Scholar 

  64. B. Brainerd, “An analog of a theorem about context-free languages,” Information and Control,11, Nos. 5–6, 561–567 (1967–68).

    Google Scholar 

  65. W. S. Brainerd, Tree-Generating Systems and Tree Automata (Doctoral Dissertation) Purdue Univ. (1967), 76 pages; Dissert. Abstr.,B28, No. 6, 2511 (1967).

  66. W. S. Brainerd, “Tree-generating regular systems,” Information and Control,14, No. 2, 217–231 (1969).

    Google Scholar 

  67. B. A. Chartres and J. J. Florentin, “A universal syntax-directed top-down analyzer,” J. Assoc. Computing Mach.,15, No. 3, 447–464 (1968).

    Google Scholar 

  68. S. N. Cole, “Real-time computation by n-dimensional iterative arrays of finite-state machines,” IEEE Trans. Computers,C-18, No. 4, 349–365 (1969).

    Google Scholar 

  69. S. A. Cook, “Characterizations of pushdown machines in terms of time-bounded computers,” J. Assoc. Computing Mach.,18, No. 1, 4–18 (1971).

    Google Scholar 

  70. J. P. Crestin, “Quasi-rational languages,” Mitt. Ges. Math. und Datenverarb., No. 8, 13–17 (1970).

    Google Scholar 

  71. D. F. Cudia and W. E. Singletary, “Degrees of unsolvability in formal grammars,” J. Assoc. Computing Mach.,15, No. 4, 680–692 (1968).

    Google Scholar 

  72. K. Čulik, “Well-translatable languages and ALGOL-like languages,” in: Formal Language Description Languages, North-Holland, Amsterdam (1966), pp. 76–85.

    Google Scholar 

  73. K. Čulik, “Languages represented by n-tape automata,” Information Processing Machines, No. 14, 83–100 (1968).

    Google Scholar 

  74. K. Čulik, “n-Ary grammars and the description of mappings of formal languages,” Kibernetika,6, No. 2, 99–117 (1970).

    Google Scholar 

  75. A. Dincă, “Ecuatii diofantice si limbaje context-free,” Stud. si Cerc. Mat.,22, No. 8, 1159–1171 (1970).

    Google Scholar 

  76. B. Drieux, “Une classe de C-langages non ambigus et non déterministes,” Compt. Rend. 94e Congr. Nat. Soc. Savant. Pau, 1969, Sec. Sci. T. 2, Paris (1971), pp. 47–52.

  77. J. Earley, “An efficient context-free parsing algorithm. Commun. Assoc. Computing Mach.,13, No. 2, 94–102 (1970).

    Google Scholar 

  78. C. C. Elgot and A. Robinson, “Random-access stored-program machines, an approach to programming languages,” J. Assoc. Computing Mach.,11, No. 4, 364–399 (1964).

    Google Scholar 

  79. G. A. Fisher and G. N. Raney, “On the representation of formal languages using automata on networks,” IEEE Conf. Rec. Tenth Ann. Sympos. Switching and Automata Theory, New York (1969), pp. 157–165.

  80. P. C. Fisher, A. R. Meyer, and A. L. Rosenberg, “Counter machines and counter languages,” Math. Syst. Theory,2, No. 3, 265–283 (1968).

    Google Scholar 

  81. J. Friant, Grammaires Ordonnees-Grammaires Matricielles, Rapport MA-101, CETADOL, Univ. Montreal (1968).

  82. J. Friant, Langages Ultralineares et Superlineares; Nouvelles Caracterisations, Rapport MA-102, CETADOL, Univ. Montreal (1968).

  83. I. Fris, “Grammars with partial ordering of the rules,” Information and Control,12, Nos. 5–6, 415–425 (1968).

    Google Scholar 

  84. K. S. Fu and T. J. Li, “On stochastic automata and languages,” Inform. Sci.,1. No. 4, 403–419 (1969).

    Google Scholar 

  85. H. Gaifman, “Dependency systems and phrase-structure systems,” Information and Control,8, No. 3, 304–337 (1965).

    Google Scholar 

  86. H. Gallaire, “Recognition time of context-free languages by on-line Turing machines,” Information and Control,15, No. 3, 288–295 (1969).

    Google Scholar 

  87. S. Ginsburg, The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York (1966), xii+232 pages.

    Google Scholar 

  88. S. Ginsburg and S. Greibach, “Abstract families of languages,” IEEE Conf. Rec. Eighth Ann. Sympos. Switching and Automata Theory, New York (1967), pp. 128–139.

  89. S. Ginsburg and S. Greibach, “Abstract families of languages,” Mem. Amer. Math. Soc., No. 87, 1–32 (1969).

    Google Scholar 

  90. S. Ginsburg and S. Greibach, “Principal AFL,” J. Comput. Syst. Sci.,4, No. 4, 308–338 (1970).

    Google Scholar 

  91. S. Ginsburg, S. Greibach, and M. A. Harrison, “Stack automata and compiling,” J. Assoc. Computing Mach.,14, No. 1, 172–201 (1967).

    Google Scholar 

  92. S. Ginsburg, S. Greibach, and M. A. Harrison, “One-way stack automata,” J. Assoc. Computing Mach.,14, No. 2, 389–418 (1967).

    Google Scholar 

  93. S. Ginsburg, S. Greibach, and J. Hopcroft, “Pre-AFL,” Mem. Amer. Math. Soc., No. 87, 41–51 (1969).

    Google Scholar 

  94. S. Ginsburg and M. A. Harrison, “Bracketed context-free languages,” J. Comput. Syst. Sci.,1, No. 1, 1–23 (1967).

    Google Scholar 

  95. S. Ginsburg and M. A. Harrison, “On the closure of AFL under reversal,” Information and Control,17, No. 4, 395–409 (1970).

    Google Scholar 

  96. S. Ginsburg and B. Partee, “A mathematical model of transformational grammars,” Information and Control,15, No. 4, 297–334 (1969).

    Google Scholar 

  97. S. Ginsburg and G. F. Rose, “A note on preservation of languages by transducers,” Information and Control,12, Nos. 5–6, 549–552 (1968).

    Google Scholar 

  98. S. Ginsburg and G. F. Rose, “On the existence of generators for certain AFL,” Inform. Sci.,2, No. 4, 431–446 (1970).

    Google Scholar 

  99. S. Ginsburg and E. H. Spanier, “Control sets on grammars,” Math. Syst. Theory,2, No. 2, 159–177 (1968).

    Google Scholar 

  100. S. Ginsburg and E. H. Spanier, “Derivation-bounded languages,” J. Comput. Syst. Sci.,2, No. 3, 228–250 (1968).

    Google Scholar 

  101. S. Ginsburg and E. H. Spanier, “Substitution in families of languages,” Inform. Sci.,2, No. 1, 83–110 (1970).

    Google Scholar 

  102. A. V. Gladkii [Gladky] and I. A. Mel'chuk [Mel'cuk], “Tree grammars (Δ-grammars),” Internat. Conf. Computational Lingustics (COLING), No. 1, Sanga-Säby (1969), 7 pages.

  103. S. A. Greibach, “A note on undecidable properties of formal languages,” Math. Syst. Theory,2, No. 1 1–6 (1968).

    Google Scholar 

  104. S. A. Greibach, “An infinite hierarchy of context-free languages,” J. Assoc. Computing Mach.,16, No. 1, 91–106 (1969).

    Google Scholar 

  105. S. A. Greibach, “Checking automata and one-way stack languages,” J. Comput. Syst. Sci.,3, No. 2, 196–217 (1969).

    Google Scholar 

  106. S. A. Greibach, “Chains of full AFL's,” Math. Syst. Theory,4, No. 3, 231–242 (1970).

    Google Scholar 

  107. S. A. Greibach, “Full AFL's and nested iterated substitution,” Information and Control,16, No. 1, 7–35 (1970).

    Google Scholar 

  108. S. A. Greibach and J. E. Hopcroft, “Scattered-context grammars,” J. Comput. Syst. Sci.,3, No. 3, 233–247 (1969).

    Google Scholar 

  109. S. A. Greibach and J. E. Hopcroft, “Independence of AFL operations,” Mem. Amer. Math. Soc., No. 87, 33–40 (1969).

    Google Scholar 

  110. T. V. Griffiths, “The unsolvability of the equivalence problem for A-free nondeterministic generalized machines,” J. Assoc. Computing Mach.,15, No. 3, 409–413 (1968).

    Google Scholar 

  111. M. Gross and A. Lentin, Notions sur les Grammaires Formelles (Publ. Inst. Programmation Fac. Sci. Paris), Paris (1967), 197 pages.

  112. J. Gruska, “Some classifications of context-free languages,” Information and Control14, No. 2, 152–179 (1969).

    Google Scholar 

  113. L. H. Haines, “Representation theorems for context-sensitive languages,” Notices Amer. Math. Soc.,16, No. 3, 527 (1969).

    Google Scholar 

  114. M. A. Harrison and M. Schkolnik, “A grammatical characterization of one-way nondeterministic stack languages,” J. Assoc. Computing Mach.,18, No. 2, 148–172 (1971).

    Google Scholar 

  115. J. Hartmanis, “On memory requirements for context-free language recognition,” J. Assoc. Computing Mach.,14, No. 4, 663–665 (1967).

    Google Scholar 

  116. J. Hartmanis and J. E. Hopcroft, “What makes some language theory problems undecidable,” J. Comput. Syst. Sci.,4, No. 4, 368–376 (1970).

    Google Scholar 

  117. I. Havel, “A note on one-sided context-sensitive grammars,” Kybernetika,5, No. 3, 186–189 (1969).

    Google Scholar 

  118. D. G. Hays, “Grouping and dependency theories,” Proc. Nat. Sympos. Machine Translation (Los Angeles, 1960), Englewood Cliffs, N. J. (1961), pp. 258–266.

  119. T. N. Hibbard, “A generalization of context-free determinism,” Information and Control,11, Nos. 1–2, 196–238 (1967).

    Google Scholar 

  120. J. E. Hopcroft, “On the equivalence and containment problems for context-free languages,” Math. Syst. Theory.,3, No. 2, 119–124 (1969).

    Google Scholar 

  121. J. E. Hopcroft and J. D. Ullman, “Sets accepted by one-way stack automata are context sensitive,” Information and Control,13, No. 2, 114–133 (1968).

    Google Scholar 

  122. J. E. Hopcroft and J. D. Ullman, Formal Languages and Their Relation to Automata, Addison-Wesley, Menlo Park, Calif. (1969), x+242 pages.

    Google Scholar 

  123. O. H. Ibarra, “Simple matrix languages,” Information and Control,17, No. 4, 359–394 (1970).

    Google Scholar 

  124. R. Ito, “Every semilinear set is a finite union of disjoint linear sets,” J. Comput. Syst. Sci.,3, No. 2, 221–231 (1969).

    Google Scholar 

  125. T. Järvi, “On control sets induced by grammars,” Suomalais. Tiedeakat. Toimituks.,A1, No. 480 (1970), 7 pages.

  126. N. D. Jones, “Context-free languages and rudimentary attributes,” Math. Syst. Theory,3, No. 2, 102–109 (1969).

    Google Scholar 

  127. N. D. Jones, “A note on the index of a context-free language,” Information and Control,16, No. 2, 201–202 (1970).

    Google Scholar 

  128. A. K. Joshi, “Properties of formal grammars with mixed type of rules and their linguistic relevance,” Internat. Conf. Computational Linguistics (COLING), Preprint No. 47, Sanga-Säby (1969), 30 pages.

  129. T. Kameda and R. Vollmar, “Note on tape reversal complexity of languages,” Information and Control,17, No. 2, 203–215 (1970).

    Google Scholar 

  130. F. P. Kaminger, “The noncomputability of the channel capacity of context-sensitive languages,” Information and Control,17, No. 2, 175–182 (1970).

    Google Scholar 

  131. T. Kasami, “An hierarchy between context-free and context-sensitive languages,” J. Comput. Syst. Sci.,4, No. 5, 492–508 (1970).

    Google Scholar 

  132. T. Kasami, “A note on computing time for recognition of languages generated by linear grammars,” Information and Control,10, No. 2, 209–214 (1967).

    Google Scholar 

  133. T. Kasami and K. Torri, “A syntax analysis procedure for unambiguous context-free grammars,” J. Assoc. Computing Mach.,16, No. 3, 423–431 (1969).

    Google Scholar 

  134. J. P. Kimball, “Predicates definable over transformational derivations by intersection with regular languages,” Information and Control,11, Nos. 1–2, 177–195 (1967).

    Google Scholar 

  135. A. Kley and G. Meyer-Brotz, “Vergleich von Analyseverfahren für kontext-freie Sprachen,” Wiss. Ber. AEG-Telefunken,41, No. 4, 205–216 (1968).

    Google Scholar 

  136. R. Knast, “Representability of nonregular languages in finite probabilistic automata,” Information and Control,16, No. 3, 285–302 (1970).

    Google Scholar 

  137. D. E. Knuth, “A characterization of parenthesis languages,” Information and Control,11, No. 3, 269–289 (1967).

    Google Scholar 

  138. D. E. Knuth, “Semantics of context-free languages,” Math. Syst. Theory,2, No. 2, 127–145 (1968).

    Google Scholar 

  139. K. Kobayashi, “Some unsolvable problems on context-free languages and their application to on-line language recognizers,” Information and Control,13, No. 3, 245–253 (1968).

    Google Scholar 

  140. K. Kobayashi, “Classification of formal languages by functional binary transductions,” Information and Control,15, No. 1, 96–109 (1969).

    Google Scholar 

  141. J. Kopřiva, “Push-down automaton with two stacks as a parsing device,” Z. Angew. Math. Mech.,48, No. 8, Suppl., 118–119 (1968).

    Google Scholar 

  142. J. Kopřiva, “Decomposition translations and syntax-directed translation schemata,” Kybernetika,6, No. 6, 403–417 (1970).

    Google Scholar 

  143. A. J. Korenjak and J. E. Hopcroft, Simple Deterministic Languages, Princeton Univ. Dept. Electr. Engng. Digital Syst. Lab. Tech. Rep. No. 51 (1966), 11 pages.

  144. S. R. Kosaraju, “Recognition of context-free and stack languages,” IEEE Conf. Rec. Tenth Ann. Sympos. Switching and Automata Theory, New York (1969), pp. 129–132.

  145. E. Kostolanský, “Comments on effective and unambiguous context-free languages,” Kybernetika,5, No. 3, 181–185 (1969).

    Google Scholar 

  146. J. Král, “On multiple grammars,” Kybernetika,5, No. 1, 60–85 (1969).

    Google Scholar 

  147. J. Král, “A modification of a substitution theorem and some necessary and sufficient conditions for sets to be context-free,” Math. Syst. Theory,4, No. 2, 129–139 (1970).

    Google Scholar 

  148. W. Kuich, “On the entropy of context-free languages,” Information and Control,16, No. 2, 173–200 (1970).

    Google Scholar 

  149. W. Kuich, “Systems of pushdown acceptors and context-free grammars,” Elektron. Informationsverarb. und Kybernet.,6, No. 2, 95–113 (1970).

    Google Scholar 

  150. W. Kuich, “The complexity of skew-linear tuple languages and O-regular languages,” Mitt. Ges. Math. und Datenverarb., No. 8, 24–26 (1970).

    Google Scholar 

  151. R. Kurki-Suonio, “Notes on top-down languages,” BIT (Sweden),9, No. 3, 225–238 (1969).

    Google Scholar 

  152. P. M. Lewis and R. E. Stearns, “Syntax-directed transduction,” J. Assoc. Computing Mach.,15, No. 3, 465–488 (1968).

    Google Scholar 

  153. P. M. Lewis, R. E. Stearns, and J. Hartmanis, “Memory bounds for recognition of contex-free and context-sensitive languages,” IEEE Conf. Rec. Switching Circuit Theory and Logical Design, New York (1965), pp. 191–202.

  154. L. Y. Liu and P. Weiner, An Infinite Hierarchy of Intersections of Context-Free Languages, Tech. Rep. Princeton Univ., No. 65 (1968), 13 pages.

  155. L. Y. Liu and P. Weiner, “A characterization of semilinear sets,” J. Comput. Syst. Sci.,4, No. 4, 299–307 (1970).

    Google Scholar 

  156. G. Mager, “Writing pushdown acceptors,” J. Comput. Syst. Sci.,3, No. 3, 276–318 (1969).

    Google Scholar 

  157. M. Magidor and G. Moran “Probabilistic tree automata and context-free languages,” Israel. J. Math.,8, No. 4, 340–348 (1970).

    Google Scholar 

  158. J. Maluszyński, “Analiza syntaktyczna przy użyciu separatorów,” Nauk. Probl. Maszyn. Mat. (Warsaw), 113–116 (1970).

  159. H. A. Maurer, “A direct proof of the inherent ambiguity of a simple context-free language,” J. Assoc. Computing Mach.,16, No. 2, 256–260 (1969).

    Google Scholar 

  160. H. A. Maurer, “A note on the complement of inherently ambiguous context-free languages,” Commun. Assoc. Computing Mach.,13, No. 3, 194 (1970).

    Google Scholar 

  161. H. A. Maurer, “The solution of a problem by Ginsburg,” Inform. Process. Lett.,1, No. 1, 7–10 (1971).

    Google Scholar 

  162. A. W. Mazurkiewicz, “A note on enumerable grammars,” Information and Control,14, No. 6, 555–558 (1969).

    Google Scholar 

  163. R. McNaughton, “Parenthesis grammars,” J. Assoc. Computing Mach.,14, No. 3, 490–500 (1967).

    Google Scholar 

  164. J. Mezei and J. B. Wright, “Algebraic automata and contex-free sets,” Information and Control,11, Nos. 1–2, 3–29 (1967).

    Google Scholar 

  165. U. G. Montanari, “Separable graphs, planar graphs, and web grammars,” Information and Control,16, No. 3, 243–267 (1970).

    Google Scholar 

  166. E. Navrátil, “Context-free grammars with regular conditions,” Kybernetika,6, No. 2, 118–126 (1970).

    Google Scholar 

  167. M. Nivat, “Transductions des langages de Chomsky,” Ann. Inst. Fourier,18, No. 1, 339–455 (1968).

    Google Scholar 

  168. W. Ogden, “A helpful result for proving inherent ambiguity,” Math. Syst. Theory,2, No. 3, 191–194 (1968).

    Google Scholar 

  169. C. Pair “Sur des notions algébriques liées à l'analyse syntaxique,” Rev. Franc. Inform. et Rech. Oper.,4, No. R-3, 3–29 (1970).

    Google Scholar 

  170. C. Pair and A. Quere, “Définition et étude des bilangages réguliers,” Information and Control,13, No. 6, 565–593 (1969).

    Google Scholar 

  171. M. C. Paull and S. H. Unger, “Structural equivalence of context-free grammars,” J. Comput. Syst. Sci.,2, No. 4, 427–463 (1968).

    Google Scholar 

  172. P. S. Peters, Jr., and R. W. Ritchie, “On restricting the base component of transformational grammars,” Information and Control,18, No. 5, 483–501 (1971).

    Google Scholar 

  173. P. S. Peters, Jr., and R. W. Ritchie, “On the generative power of transformational grammars,” Inform. Sci. (1971).

  174. G. Révész, “An efficient syntactic analyser of certain formal languages,” Math. Syst. Theory,2, No. 2, 147–158 (1968).

    Google Scholar 

  175. G. Révész, “Syntactic analysis and unilateral context-sensitive grammars,” Studia Sci. Math. Hung.,4, Nos. 1–4, 267–278 (1969).

    Google Scholar 

  176. J. Rhodes and E. Shamir, “Complexity of grammars by group-theoretic methods,” J. Combinat. Theory,4, No. 3, 222–239 (1968).

    Google Scholar 

  177. G. F. Rose, “Closures which preserve finiteness in families of languages,” J. Comput. Syst. Sci.,2, No. 2, 148–168 (1968).

    Google Scholar 

  178. A. L. Rosenberg, “A machine realization of the linear context-free languages,” Information and Control,10, No. 2, 175–188 (1967).

    Google Scholar 

  179. A. L. Rosenberg, “On the independence of real-time definability and certain structural properties of context-free languages,” J. Assoc. Computing Mach.,15, No. 4, 672–679 (1968).

    Google Scholar 

  180. G. Rosenberg, “On the introduction of the orderings into the grammars of Chomsky's hierarchy,” Bull. Acad. Polon. Sci., Ser. Sci. Math. Astron. et Phys.,17, No. 9, 559–563 (1969).

    Google Scholar 

  181. M. Rosendahl, “Zur Erkennung mehrdimensionaler formaler Sprachen,” Mitt. Ges. Math. und Datenverarb.,8, No. 8, 33–35 (1970).

    Google Scholar 

  182. D. J. Rosenkrantz, “Matrix equations and normal forms for context-free grammars,” J. Assoc. Computing Mach.,14, No. 3, 501–507 (1967).

    Google Scholar 

  183. D. J. Rosenkrantz, “Programmed grammars-a new device for generating formal languages,” IEEE Conf. Rec. Eighth Ann. Sympos. Switching and Automata Theory, New York (1967), pp. 14–20.

  184. D. J. Rosenkrantz, “Programmed grammars and classes of formal languages,” J. Assoc. Computing Mach.,16, No. 1, 107–131 (1969).

    Google Scholar 

  185. D. J. Rosenkrantz and P. M. Lewis, “Deterministic left-corner parsing,” IEEE Conf. Rec. Eleventh Ann. Sympos. Switching and Automata Theory, New York (1970), pp. 139–152.

  186. D. J. Rosenkrantz and R. E. Stearns, “Properties of deterministic top-down grammars,” Information and Control,17, No. 3, 226–256 (1970).

    Google Scholar 

  187. B. Rovan, “Bounded push-down automata,” Kybernetika,5, No. 4, 261–265 (1969).

    Google Scholar 

  188. A. Salomaa, “On the index of a context-free grammar and language,” Information and Control,14, No. 5, 474–477 (1969).

    Google Scholar 

  189. A. Salomaa, “On grammars with restricted use of productions,” Suomalais. Tiedeakat. Toimituks. Ser. A1, No. 454 (1969), 32 pages.

  190. A. Salomaa, “Probabilistic and weighted grammars,” Information and Control,15, No. 6, 529–544 (1969).

    Google Scholar 

  191. A. Salomaa, “Periodically time-variant context-free grammars,” Information and Control,17, No. 3, 294–311 (1970).

    Google Scholar 

  192. A. Salomaa, “The generative capacity of transformational grammars of Ginsburg and Partee,” Information and Control,18, No. 3, 227–232 (1971).

    Google Scholar 

  193. V. Schneider, “Syntax-checking and parsing of context-free languages by pushdown-store automata,” AFIPS Conf. Proc., Vol. 30, Spring Joint Computer Conf., Thompson, Washington, D. C; Academic Press, London (1967), pp. 685–690.

  194. R. Siromoney, “On equal matrix languages,” Information and Control,14, No. 2, 135–151 (1969).

    Google Scholar 

  195. R. Siromoney, “A characterization of semilinear sets,” Proc. Amer. Math. Soc.,21, No. 3, 689–694 (1969).

    Google Scholar 

  196. R. Siromoney, “Channel capacity of equal matrix languages,” Information and Control,14, No. 6, 507–511 (1969).

    Google Scholar 

  197. A. R. Smith, “Cellular automata and formal languages,” IEEE Conf. Rec. Eleventh Ann. Sympos. Switching and Automata Theory, New York (1970), pp. 216–224.

  198. R. E. Stearns, “A regularity test for pushdown machines,” Information and Control,11, No. 3, 323–340 (1967).

    Google Scholar 

  199. R. E. Stearns and P. M. Lewis, “Property grammars and table machines,” Information and Control,14, No. 6, 524–549 (1969).

    Google Scholar 

  200. K. Taniguchi and T. Kasami, “A note on computing time for the recognition of context-free languages by a singie-tape Turing machine,” Information and Control,14, No. 3, 278–284 (1969).

    Google Scholar 

  201. J. W. Thatcher, “Characterizing derivation trees of context-free grammars through a generalization of finite automata theory,” J. Comput. Syst. Sci.,1, No. 4, 317–322 (1967).

    Google Scholar 

  202. J. W. Thatcher, “Generalized sequential machine maps,” Comput. Syst. Sci.,4, No. 4, 339–367 (1970).

    Google Scholar 

  203. P. Turakainen, “On stochastic languages,” Information and Control,12, No. 4, 304–313 (1968).

    Google Scholar 

  204. J. S. Uuian, “Partial algorithm problems for context-free languages,” Information and Control,11, Nos. 1–2, 80–101 (1967).

    Google Scholar 

  205. S. H. Unger, “A global parser for context-free phrase-structure grammars,” Commun. Assoc. Computing Mach.,11, No. 4, 240–247 (1968).

    Google Scholar 

  206. G. Veillon, J. Veyrunes, and 3. Vauquois, “Un métalangage de grammaires transformationnelles; applications aux problèmes de transferts et de generation syntaxiques,” Second Internat. Conf. Automatic Languages, Grenoble (1967).

  207. H. Walter, “Zwei Operationen zwischen Chomsky-Grammatiken,” Z. Angew. Math. Mech.,50, Suppl. 1–4, 91–92 (1970).

    Google Scholar 

  208. H. Walter, “Verallgemeinerte Pullbackkonstruktionen bei Semi-Thuesystemen und Grammatiken,” Elektron. Informationverarb. und Kybernet.,6, Nos. 4–5, 239–254 (1970).

    Google Scholar 

  209. H. Walter, “Verallgemeinerte Pullbackkonstruktionen bei Chomsky-Grammatiken,” Mitt. Ges. Math. un Datenverarb., No. 8, 56–58 (1970).

    Google Scholar 

  210. D. A. Walters, “Deterministic context-sensitive languages, Part I,” Information and Control,17, No. 1, 14–40 (1970).

    Google Scholar 

  211. D. A. Walters, “Deterministic context-sensitive languages, Part II,” Information and Control,17, No. 1, 41–61 (1970).

    Google Scholar 

  212. Y. R. Wang, “On the formulation of normal pushdown acceptors,” Proc. 23rd ACM Nat. Conf., Princeton-London (1968), pp. 605–612.

  213. R. Weicker, “Erckennung von kontextfreien Sprachen durch Tabulator-Turingmaschinen,” Arbeitsber. Inst. Math. Masch. und Datenverarb.,3, No. 5 (1970), 101 pages.

  214. D. Wood, “A note on top-down deterministic languages,” BIT (Sweden),9, No. 4, 387–399 (1969).

    Google Scholar 

  215. D. Wood, “Formal language theory and automata theory bibliography 23,” Comput. Rev.,11, No. 7, 417–430 (1970).

    Google Scholar 

  216. D. Wood, “A generalized normal form theorem for context-free grammars,” Comput. J.,13, No. 3, 272–277 (1970).

    Google Scholar 

  217. W. A. Woods, “Context-sensitive parsing,” Commun. Assoc. Computing Mach.,13, No. 7, 437–445 (1970).

    Google Scholar 

  218. W. A. Woods, “Transition network grammars for natural language analysis,” Commun. Assoc. Computing Mach.,13, No. 10, 591–606 (1970).

    Google Scholar 

  219. M. K. Yntema, “Inclusion relations among families of context-free languages,” Information and Control,10, No. 6, 572–597 (1967).

    Google Scholar 

  220. D. H. Younger, “Recognition and parsing of context-free languages in time n3,” Information and Control,10, No. 2, 189–208 (1967).

    Google Scholar 

Download references

Authors
  1. A. V. Gladkii
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Ya. Dikovskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Itogi Nauki i Tekhniki (Teoriya Veroyatnostei, Matematicheskaya Statistika, Teoreticheskaya Kibernetika), Vol. 10, pp. 107–142, 1972.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gladkii, A.V., Dikovskii, A.Y. Theory of formal grammars. J Math Sci 2, 542–563 (1974). https://doi.org/10.1007/BF01085017

Download citation

  • Issue Date:

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

Keywords

Search

Navigation