Skip to main content
SpringerLink
Log in

Church-Rosser Languages vs. UCFL

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 2002)

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

Included in the following conference series:

Abstract

The class of growing context-sensitive languages (GCSL) was proposed as a naturally defined subclass of context-sensitive languages whose membership problem is solvable in polynomial time. In this paper we concentrate on the class of Church Rosser Languages (CRL), the “deterministic counterpart” of GCSL. We prove the conjecture (stated in [9] that the set of palindromes is not in CRL. This implies that CFL∩co-CFL as well as UCFL∩co-UCFL are not included in CRL, where UCFL denotes the class of unambiguous context-free languages. Our proof uses a novel pumping technique, which is of independent interest.

Partially supported by DFG grant GO 493/1-1 and Komitet Badań Naukowych, grant 8T11C04419.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Beaudry, M. Holzer, G. Niemann, F. Otto, McNaughton Languages, Mathematische Schriften Kassel 26/00 (conference version: On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy, DLT 2001, LNCS 2295, 340–348).

    Google Scholar 

  2. G. Buntrock, Wachsende Kontextsensitive Sprachen, Habilitationsschrift, Würzburg, 1995.

    Google Scholar 

  3. G. Buntrock, K. Loryś, On growing context-sensitive languages, Proc. of International Colloquium on Automata, Languages and Programming, 1992, LNCS 623, 77–88.

    Google Scholar 

  4. G. Buntrock, K. Loryś, The variable membership problem: Succintness versus complexity, Proc. of STACS, 1994, LNCS 775, Springer-Verlag, 595–606.

    Google Scholar 

  5. G. Buntrock, F. Otto, Growing Context-Sensitive Languages and Church-Rosser Languages, Information and Computation 141 (1998), 1–36.

    Article  MATH  MathSciNet  Google Scholar 

  6. E. Dahlhaus, M.K. Warmuth, Membership for growing context-sensitive grammars is polynomial, Journal of Computer Systems Sciences, 33 (1986), 456–472.

    Article  MATH  MathSciNet  Google Scholar 

  7. A. Gladkij, On the complexity of derivations for context-sensitive grammars, Algebri i Logika 3, 1964, 29–44. [In Russian]

    MATH  Google Scholar 

  8. M. A. Harrison, Introduction to Formal Language Theory, Addison-Wesley, 1978.

    Google Scholar 

  9. R. McNaughton, P. Narendran, F. Otto, Church-Rosser Thue systems and formal languages, Journal of the Association Computing Machinery, 35 (1988), 324–344.

    MATH  MathSciNet  Google Scholar 

  10. M. Li, P. Vitanyi, An Introduction to Kolmogorov Complexity and its Applications, Springer-Verlag 1993.

    Google Scholar 

  11. M. Li, P. Vitanyi, A New Approach to Formal Language Theory by Kolmogorov Complexity, SIAM J. on Comp., 24:2(1995), 398–410.

    Article  MathSciNet  Google Scholar 

  12. G. Niemann, CRL, CDRL und verkuerzende Zweikellerautomaten., Unpublished note, 1997.

    Google Scholar 

  13. G. Niemann, F. Otto, Restarting automata, Church-Rosser languages, and confluent internal contextual languages, Proc. of DLT 99, Aachener Informatik-Berichte 99-5, 49–62.

    Google Scholar 

  14. G. Niemann, F. Otto, The Church-Rosser Languages Are the Deterministic Variants of the Growing Context-Sensitive Languages, FoSSaCC 1998, LNCS 1378, 243–257.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Chemnitz University of Technology, USA

    Tomasz Jurdziński

  2. Institute of Computer Science, Wrocław University, Poland

    Tomasz Jurdziński & Krzysztof Loryś

Authors
  1. Tomasz Jurdziński
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Krzysztof Loryś
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Theoretical Computer Science, ETH Zentrum, ETH Zürich, 8092, Zürich, Switzerland

    Peter Widmayer  & Stephan Eidenbenz  & 

  2. Department of Languages and Sciences of the Computation E.T.S. de Ingeniería Informática, University of Málaga, Campus de Teatinos, 29071, Málaga, Spain

    Francisco Triguero , Rafael Morales  & Ricardo Conejo ,  & 

  3. School of Cognitive and Computing Sciences, University of Sussex, Falmer, Brighton, BN1 9QN, UK

    Matthew Hennessy

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jurdziński, T., Loryś, K. (2002). Church-Rosser Languages vs. UCFL. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds) Automata, Languages and Programming. ICALP 2002. Lecture Notes in Computer Science, vol 2380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45465-9_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-45465-9_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45465-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation