Skip to main content
SpringerLink
Log in

The decidability of the generalized confluence problem for context-free languages

  • 6. Algebraic Approaches to Languages
  • Chapter
  • First Online:
Book cover New Trends in Formal Languages

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

  • 89 Accesses

Abstract

A language \(L \subseteq \sum {^* }\)is confluent with respect to a given quasi order ≤ on σ* if, for any x,y ε L, there is z ε L such that x ≤ z and y ≤ z. L is confluent with respect to ≤ in generalized sense if it is a finite union of languages confluent with respect to ≤. We investigate in this paper the decidability of the generalized confluence problem with respect to the prefix partial order and the factor partial order for context-free languages, thus generalizing previous results concerning the decidability of the ordinary confluence problem.

Research supported by the Academy of Finland, Project 11281

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.

References

  1. C. Choffrut, J. Karhumäki, Combinatorics of Words, in Handbook of Formal Languages, (G. Rozenberg, A Salomaa, eds.), to appear.

    Google Scholar 

  2. T. Harju, L. Ilie, On quasi orders of words and the confluence property, manuscript.

    Google Scholar 

  3. J. E. Hopcroft, J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Mass., 1979.

    Google Scholar 

  4. L. Ilie, On a conjecture about slender context-free languages, Theoretical Computer Science 132 (1994) 427–434.

    Google Scholar 

  5. L. Ilie, On slender context-free languages, manuscript.

    Google Scholar 

  6. L. Ilie, A. Salomaa, On well quasi orders of free monoids, manuscript.

    Google Scholar 

  7. M. Lothaire, Combinatorics on Words, Addison-Wesley, Reading, Mass., 1983.

    Google Scholar 

  8. Gh. Păun, A. Salomaa, Thin and slender languages, Discrete Appl. Math. 61 (1995) 257–270.

    Google Scholar 

  9. A. Salomaa, Formal Languages, Academic Press, New York, 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics, University of Bucharest, Str. Academiei 14, 70109, Bucureşti, Romania

    Lucian Ilie

Authors
  1. Lucian Ilie
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gheorghe Păun Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Ilie, L. (1997). The decidability of the generalized confluence problem for context-free languages. In: Păun, G., Salomaa, A. (eds) New Trends in Formal Languages. Lecture Notes in Computer Science, vol 1218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62844-4_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-62844-4_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62844-6

  • Online ISBN: 978-3-540-68703-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation