EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 16 / No 1 (1982) RAIRO. Inform. théor., 16 1 (1982) 3-11 References
Free Access
Issue
RAIRO. Inform. théor.
Volume 16, Number 1, 1982
Page(s) 3 - 11
DOI https://doi.org/10.1051/ita/1982160100031
Published online 01 February 2017
  1. 1. A.V. AHO, Indexed Grammars - an Extension of Context - Free Grammars, J. Assoc. Comput. Mach., Vol. 15, 1968, pp. 647-671. [MR: 258547] [Zbl: 0175.27801] [Google Scholar]
  2. 2. J. ALBERT, Über indizierte und m-Block-indizierte Grammatiken, Ph. D. Thesis, Institut fur Angewandte Informatik und Formale Beschreibungsverfahren, Univ. Karlsruhe, 1976. [Google Scholar]
  3. 3. J. ALBERT and L. WEGNER, Languages with Homomorphic Replacements, Theor. Comput. Sc., Vol. 16, 1981, pp. 291-305. [MR: 642323] [Zbl: 0468.68085] [Google Scholar]
  4. 4. P. ASVELD and J. ENGELFRIET, Iterated Deterministic Substitution, Acta Informatica, Vol. 8, 1977, pp. 285-302. [MR: 478764] [Zbl: 0343.68034] [Google Scholar]
  5. 5. J.-M. AUTEBERT, J. BEAUQUIER, L. BOASSON and M. LATTEUX, Indécidabilité de la condition IRS, Université de Lille I, publication n° 18.79, 1979. [Google Scholar]
  6. 6. B. S. BAKER and R. V. BOOK, Reversal-Bounded Multipush-down Machines, J. Comput. System Sci., Vol. 8, 1974, pp. 315-332. [MR: 375844] [Zbl: 0309.68043] [Google Scholar]
  7. 7. Y. BAR-HILLEL, M. PERLES and E. SHAMIR, On Formal Properties of Simple Phrase-Structure Grammars, Z. f. Phonetik, Sprachwissenschaft, Kommunikations-forschung, Vol. 14, 1961, pp. 143-177. [MR: 151376] [Zbl: 0106.34501] [Google Scholar]
  8. 8. J. ENGELFRIET, E. MEINECHE SCHMIDT and J. VAN LEEUWEN, Stack Machines and Classes of Nonnested Macro Languages, J. Assoc. Comput. Mach., Vol.27, 1980, pp. 96-117. [MR: 554283] [Zbl: 0428.68087] [Google Scholar]
  9. 9. M. J. FISCHER, Grammars with Macro-like Productions, Ph. D. Thesis, Haryard Univ., Cambridge, Mass., 1968. [Google Scholar]
  10. 10. S. GINSBURG and H. G. RICE, Two Families of Languages Related to ALGOL, J. Assoc. Comput. Mach., Vol. 9, 1962, pp. 350-371. [MR: 152158] [Zbl: 0196.01803] [Google Scholar]
  11. 11. S. GINSBURG, Formal Languages, North-Holland, Amsterdam, 1975. [Google Scholar]
  12. 12. S. GREIBACH, A Note on Undecidable Properties of Formal Languages, Math. Systems Theory, Vol. 2, 1968, pp. 1-6. [MR: 225609] [Zbl: 0157.01902] [Google Scholar]
  13. 13. S. GREIBACH, An Infinite Hierarchy of Context-Free Languages, J. Assoc. Comput. Mach., Vol. 16, 1969, pp. 9-106. [MR: 238632] [Zbl: 0182.02002] [Google Scholar]
  14. 14. S. GREIBACH, Checking Automata andone-way Stack Languages, J. Comput. System Sc., Vol.3, 1969, pp. 196-217. [MR: 243953] [Zbl: 0174.02702] [Google Scholar]
  15. 15. S. GREIBACH, One Way Finite Visit Automata, Theor. Comput. Sc.,Vol. 6, 1978, pp. 175-221. [MR: 489039] [Zbl: 0368.68059] [Google Scholar]
  16. 16. M. A. HARRISON, Introduction to Formal Language Theory, Addison-Wesley, Reading, Massachusetts, 1978. [MR: 526397] [Zbl: 0411.68058] [Google Scholar]
  17. 17. D. E. KNUTH, On the Translation of Languages from Left to Right, Information and Control, Vol. 8, 1965, pp. 607-635. [MR: 189942] [Zbl: 0231.68027] [Google Scholar]
  18. 18. M. LEVITINA, O nekotoryh grammatikah s pravilami globalnoi podstanovki, Akad. Nauk S.S.S.R. Nauchno-Tekhn. Inform., Ser. 2, 1973, pp. 32-36. [Zbl: 0291.68024] [Google Scholar]
  19. 19. M. LINNA, The DOL-Ness for Context-FreeLanguages is Decidable, Inf. Process. Letters, Vol. 5, 1976, pp. 149-151. [MR: 451889] [Zbl: 0346.68033] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.