EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 13 / No 3 (1979) RAIRO. Inform. théor., 13 3 (1979) 203-215 References
Free Access
Issue
RAIRO. Inform. théor.
Volume 13, Number 3, 1979
Page(s) 203 - 215
DOI https://doi.org/10.1051/ita/1979130302031
Published online 01 February 2017
  1. 1. J. BEAUQUIER, Générateurs algébriques non-ambigus, in Automata, Languages and Programming, Third International Colloquium, S. MICHAELSON and R. MILNER, éd., Edinburgh University Press, 1976, p. 66-73. [Zbl: 0363.68106] [Google Scholar]
  2. 2. L. BOASSON, Cônes rationnels et familles agréables de langages, Thèse de 3e cycle, Université Paris-VII, 1971. [Google Scholar]
  3. 3. L. BOASSON, The Inclusion of the Substitution Closure of Linear and One Counter Languages in the Largest Full-Sub AFL of the CFL is Proper, Information Processing Letters, vol. 2, 1973, p. 135-140. [MR: 345452] [Zbl: 0329.68067] [Google Scholar]
  4. 4. L. BOASSON, Un langage algébrique non-générateur, in 3rd G. I. Conference. Lecture Notes in Comp. Science, n° 48, Springer-Verlag, 1977, p. 145-148. [MR: 489028] [Zbl: 0361.68111] [Google Scholar]
  5. 5. L. BOASSON et M. NIVAT, Parenthesis Generators, 17th Annual Symposium on F.O.C.S. (ex. SWAT), 1976, p. 253-257. [MR: 455560] [Google Scholar]
  6. 6. C. FROUGNY, Langages très simples générateurs, R.A.I.R.O., Informatique théorique, vol. 13, 1979, p. 69-86. [EuDML: 92091] [MR: 525458] [Zbl: 0405.68063] [Google Scholar]
  7. 7. S. GREIBACH, Chains of Full. AFL's, Math. Systems Theory, vol. 4, 1970, p. 231-242. [MR: 329324] [Zbl: 0203.30102] [Google Scholar]
  8. 8. S. GREIBACH, One Counter Languages and the IRS Condition, J. Comp. System. Science, vol. 10, 1975, p. 237-247. [MR: 395352] [Zbl: 0307.68062] [Google Scholar]
  9. 9. M. NIVAT, Sur les ensembles de mots infinis engendrés par une grammaire algébrique, R.A.I.R.O., Informatique théorique, vol. 12, 1978, p. 259-278. [EuDML: 92080] [MR: 510641] [Zbl: 0387.68050] [Google Scholar]
  10. 10. W. OGDEN, A Helpful Result for Proving Inherent Ambiguity, Math. Systems Theory, vol. 2, 1967, p. 191-194. [MR: 233645] [Zbl: 0175.27802] [Google Scholar]
  11. 11. L. BOASSON, B. COURCELLE et M. NIVAT, A New Complexity Measure for Languages, in A Conference on Theoretical Computer Science, Waterloo, 1977, p. 130-138. [MR: 495182] [Zbl: 0431.68077] [Google Scholar]
  12. 12. A. SALOMAA, Formal Languages, Academic press, 1973. [MR: 438755] [Zbl: 0262.68025] [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.