Advertisement

Strong non-deterministic context-free languages

  • Joffroy Beauquier
Vorträge (In Alphabetischer Reihenfolge)
Part of the Lecture Notes in Computer Science book series (LNCS, volume 67)

Keywords

Rational Cone Finite Automaton Strong Property Transfer Theorem Rational Transduction 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. [1]
    BEAUQUIER J. — 1977 — Contribution à l'Etude de la Complexité Structurelle des langages Algébriques, Thèse de Doctorat d'Etat — Université Paris VII.Google Scholar
  2. [2]
    BEAUQUIER J. — 1978 — Générateurs Algébriques et Systèmes de Paires Itérantes-To appear in Theoretical Computer Science.Google Scholar
  3. [3]
    BEAUQUIER J. — 1978 — Ambiguïté forte. In proceedings of the 5th I.C.A.L.P. — Udine-Italy, Lecture Notes in Computer Science 62, p. 52–62.Google Scholar
  4. [4]
    BEAUQUIER J. — Substitutions de langages linéaires et de langages à compteur. Submitted to the Jour. of Comp. and Syst. Sciences.Google Scholar
  5. [5]
    BERSTEL J. — 1979 — Transductions and Context-Free Languages. Teubner Verlag.Google Scholar
  6. [6]
    BOASSON L. — 1976 — Langages Algébriques, Paires Itérantes et Transductions Rationnelles — Theoretical Computer Science 2, p.209–223.CrossRefGoogle Scholar
  7. [7]
    CRESTIN J.P. — 1972 — Sur un language non-ambigu dont le carré est d'ambiguïté inhérente non-bornée. Actes du Colloque I.R.I.A.Google Scholar
  8. [8]
    EILENBERG S. — 1970 — Communication au Congrès International des Mathématiciens Nice — France.Google Scholar
  9. [9]
    GINSBURG S. — 1966 — The Mathematical Theory of Context-Free Languages. Mc Graw HillGoogle Scholar
  10. [10]
    GINSBURG S. and SPANIER E.H. — 1968 — Derivation Bounded Languages, Journ. of Comp. and Syst. Sciences 2, p. 228–250.Google Scholar
  11. [11]
    GREIBACH S. — 1970 — Chains of full AFL'S — Math. System Theory 4, p. 231–242.CrossRefGoogle Scholar
  12. [12]
    GREIBACH S. — 1972 — Syntactic Operators on full Semi-AFL's. Journ. of Comp. and Syst. Sciences 6, p. 30–76.Google Scholar
  13. [13]
    HAINES L.H. 1965 — Generation and Recognition of Formal Languages. Doctoral Dissertation. M.I.T.Google Scholar
  14. [14]
    OGDEN W. 1967 — A helpful Result for Proving Inherent Ambiguity — Math. System Theory 2, p. 191–194.CrossRefGoogle Scholar
  15. [15]
    PARIKH R.J. — 1966 — On Context-Free Languages. J.A.C.M. 13, p. 570–581.Google Scholar
  16. [16]
    SHAMIR E. — 1961 — Some Inherently Ambiguous Context-Free Languages, Information and Control 18, p. 355–363.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Joffroy Beauquier

There are no affiliations available

Personalised recommendations