Skip to main content
SpringerLink
Log in

Strong non-deterministic context-free languages

  • Vorträge (In Alphabetischer Reihenfolge)
  • Conference paper
  • First Online:
Theoretical Computer Science 4th GI Conference

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 67))

  • 114 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  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. BEAUQUIER J. — 1978 — Générateurs Algébriques et Systèmes de Paires Itérantes-To appear in Theoretical Computer Science.

    Google Scholar 

  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. BEAUQUIER J. — Substitutions de langages linéaires et de langages à compteur. Submitted to the Jour. of Comp. and Syst. Sciences.

    Google Scholar 

  5. BERSTEL J. — 1979 — Transductions and Context-Free Languages. Teubner Verlag.

    Google Scholar 

  6. BOASSON L. — 1976 — Langages Algébriques, Paires Itérantes et Transductions Rationnelles — Theoretical Computer Science 2, p.209–223.

    Article  Google Scholar 

  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. EILENBERG S. — 1970 — Communication au Congrès International des Mathématiciens Nice — France.

    Google Scholar 

  9. GINSBURG S. — 1966 — The Mathematical Theory of Context-Free Languages. Mc Graw Hill

    Google Scholar 

  10. GINSBURG S. and SPANIER E.H. — 1968 — Derivation Bounded Languages, Journ. of Comp. and Syst. Sciences 2, p. 228–250.

    Google Scholar 

  11. GREIBACH S. — 1970 — Chains of full AFL'S — Math. System Theory 4, p. 231–242.

    Article  Google Scholar 

  12. GREIBACH S. — 1972 — Syntactic Operators on full Semi-AFL's. Journ. of Comp. and Syst. Sciences 6, p. 30–76.

    Google Scholar 

  13. HAINES L.H. 1965 — Generation and Recognition of Formal Languages. Doctoral Dissertation. M.I.T.

    Google Scholar 

  14. OGDEN W. 1967 — A helpful Result for Proving Inherent Ambiguity — Math. System Theory 2, p. 191–194.

    Article  Google Scholar 

  15. PARIKH R.J. — 1966 — On Context-Free Languages. J.A.C.M. 13, p. 570–581.

    Google Scholar 

  16. SHAMIR E. — 1961 — Some Inherently Ambiguous Context-Free Languages, Information and Control 18, p. 355–363.

    Article  Google Scholar 

Download references

Authors
  1. Joffroy Beauquier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. Weihrauch

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Beauquier, J. (1979). Strong non-deterministic context-free languages. In: Weihrauch, K. (eds) Theoretical Computer Science 4th GI Conference. Lecture Notes in Computer Science, vol 67. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09118-1_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-09118-1_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09118-9

  • Online ISBN: 978-3-540-35517-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation