EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 12 / No 3 (1978) RAIRO. Inform. théor., 12 3 (1978) 193-199 References
Free Access
Issue
RAIRO. Inform. théor.
Volume 12, Number 3, 1978
Page(s) 193 - 199
DOI https://doi.org/10.1051/ita/1978120301931
Published online 01 February 2017
  1. 1. Y. BAR-HILLEL, M. PERLES and E. SHAMIR, On Formal Properties of Simple Phrase Structure Grammars, Zeitschr. Phonetik, Sprachwiss., Kommunikationsforsch., Vol. 14, 1961, p. 143-172. [MR: 151376] [Zbl: 0106.34501] [Google Scholar]
  2. 2. S. GINSBURG, The Mathematical Theory of Context-free Languages, McGraw-Hill, New York, 1966. [MR: 211815] [Zbl: 0184.28401] [Google Scholar]
  3. 3. J. E. HOPCROFT and J. D. ULLMAN, Formal Languages and their Relation to Automata, Addison-Wesley, Reading, Mass., 1969. [MR: 237243] [Zbl: 0196.01701] [Google Scholar]
  4. 4. D. F. MARTIN, Formal Languages and their Related Automata, in Computer Science, A. F. CARDENAS, L. PRESSER and M. MARIN, eds., Wiley-Interscience, New York, London, 1972, p. 409-460. [Google Scholar]
  5. 5. A. SALOMAA, Formal Languages, Academic Press, New York, London, 1973. [MR: 438755] [Zbl: 0262.68025] [Google Scholar]
  6. 6. S. GINSBURG and S. GREIBACH, Abstract Families of Languages, Mem. Amer. Math. Soc., Vol. 87, 1969, p. 1-32. [MR: 297491] [Zbl: 0194.31402] [Google Scholar]
  7. 7. W. S. BRAINERD and L. H. LANDWEBER, Theory of Computation, Wiley-Interscience, New York, London, 1974. [MR: 400760] [Zbl: 0274.68001] [Google Scholar]
  8. 8. S. HORVÁTH, BHFL: the Family of Languages Satisfying Bar-Hillel's Lemma, 2nd Hungarian Computer Science Conf., Budapest, June 27-July 2, preprints, Vol. I, p. 479-483. [Google Scholar]
  9. 9. C. CÎSLARU and G. PĂUN, Classes of Languages with the Bar-Hillel, Perles and Shamir's Property, Bull. Math. Soc. Sc. Math. R. S. Roum., Bucharest, Vol. 18, No. 3-4, 1974 (received: July, 1975; appeared: 1976) p. 273-278. [MR: 421160] [Zbl: 0328.68070] [Google Scholar]
  10. 10. V. COARDOS, O clasă de limbaje neidependente de context care verifică conditia lui Bar-Hillel, Stud. cerc. mat., Bucharest, Vol. 27, No. 4, 1975, p. 407-411. [MR: 483740] [Zbl: 0324.68047] [Google Scholar]
  11. 11. G. PĂUN, Asupra proprietătii lui Bar-Hillel, Perles si Shamir, Stud. cerc. mat., Bucharest, Vol. 28, No. 3, 1976, p. 303-309. [MR: 443456] [Zbl: 0337.68052] [Google Scholar]
  12. 12. T. KLØVE, Pumping languages, Internat. J. Comp. Math., R. RUSTIN, éd., Gordon and Breach Sc. Publishers, London, New York, Paris; Vol. 6, No. 2, 1977, p. 115-125. [MR: 468348] [Zbl: 0358.68123] [Google Scholar]
  13. 13. W. OGDEN, A Helpful Result for Proving Inherent Ambiguity, Math. Syst. Theory, Vol. 2, No. 3, 1968, p. 191-194. [MR: 233645] [Zbl: 0175.27802] [Google Scholar]
  14. 14. A. V. AHO and J. D. ULLMAN, The Theory of Parsing, Translation, and Compiling, Vol. I, "Parsing", Prentice-Hall, 1971, 2nd printing: 1972, section 2.6. [Zbl: 0217.53803] [MR: 408321] [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.