Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1986: Mathematical Foundations of Computer Science 1986 pp 554–563Cite as

One-sided Dyck reduction over two letter alphabet and deterministic context-free languages

  • Communications
  • Conference paper
  • First Online:

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

Abstract

We characterize the deterministic context-free languages that are unions of equivalence classes in the equivalence generated by the one-sided Dyck reduction over a two-letter alphabet.

This research was supported in part by A.D.I. under contract 83/695

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. References

  1. M. Benois: Parties rationnelles du groupe libre C.R. Acad. Sc. Paris, Ser. A 269, 1969, 1188–1190.

    Google Scholar 

  2. R. Book, M. Jantzen, and C. Wrathall: Monadic Thue Systems, Theoret. Comput. Sci 19, 1982, 231–251.

    Google Scholar 

  3. A. H. Clifford, and G. B. Preston: The algebraic theory of semigroups, Amer. Math. Soc, Vol 1: 1961, Vol 2: 1967.

    Google Scholar 

  4. Y. Cochet et M. Nivat: Une généralisation des ensembles de Dyck, Israel J. of Math. 9, 1971, 389–395.

    Google Scholar 

  5. G. Duchamp: Etude d'un treillis, relations d'équivalence régulières sur le monoïde bicyclique, to appear.

    Google Scholar 

  6. S. Ginsburg and S. Greibach: Deterministic context-free languages, Inform. and Control 9, 1966, 620–648.

    Google Scholar 

  7. M. Harrison: Introduction to formal language theory, Addison Wesley, 1978.

    Google Scholar 

  8. M. Jantzen: Thue systems and the Church-Rosser property, M.F.C.S. 1984, Lecture Notes in Computer Science 176, Springer, 1984, 80–95.

    Google Scholar 

  9. M. Nivat: On some families of languages related to the Dyck lnaguage, in Proc. of the Second Annual ACM Symp. on Computing, 1970, 221–225.

    Google Scholar 

  10. J.F. Perrot: Monoïdes syntactiques des langages algébriques, Acta Informatica 7, 1977, 399–413.

    Google Scholar 

  11. J.F. Perrot et J. Sakarovitch: Lanages algébriques déterministes et groupes abéliens, in Automata Theory and Formal Languages (H. Brakhage, ed.), Lecture Notes in Computer Science 33, Springer, 1975, 20–30.

    Google Scholar 

  12. J. Sakarovitch: Syntaxe des langages de Chomsky. Th. Sc. Math., Univ. Paris VII, Paris, 1979.

    Google Scholar 

  13. J. Sakarovitch: Théorème de transversale rationnelle pour les automates à pile déterministes, in Proc. of 4th G.I. Conference on Theorical Computer Science (K. Weihrauch ed.), Lecture Notes in Computer Science 67, Springer, 1979, 276–285.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'Informatique Théorique et Programmation. C.N.R.S., Université Paris VI, 4 place Jussieu, 75230, Paris Cedex 05

    Fabienne Romian & Jacques Sakarovitch

Authors
  1. Fabienne Romian
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jacques Sakarovitch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska Branislav Rovan Juraj Wiedermann

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Romian, F., Sakarovitch, J. (1986). One-sided Dyck reduction over two letter alphabet and deterministic context-free languages. In: Gruska, J., Rovan, B., Wiedermann, J. (eds) Mathematical Foundations of Computer Science 1986. MFCS 1986. Lecture Notes in Computer Science, vol 233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016282

Download citation

  • DOI: https://doi.org/10.1007/BFb0016282

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39909-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation