Skip to main content
SpringerLink
Log in

On a Conjecture of Schnoebelen

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2003)

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

Included in the following conference series:

Abstract

The notion of sequential and parallel decomposition of a language over a set of languages was introduced by Schnoebelen. A language is decomposable if it belongs to a finite set of languages S such that each member of S admits a sequential and parallel decomposition over S. We disprove a conjecture of Schnoebelen concerning decomposable languages and establish some new properties of these languages.

Work supported by INTAS project 1224

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. J.C.M. Baeten and W.P. Weijland. Process algebra, volume 18 of Cambridge Tract in. Theoretical Computer Science. Cambridge University Press, Cambridge UK, 1990.

    Google Scholar 

  2. John H. Conway. Regular Algebra and Finite Machines. Chapman and Hall, London, 1971.

    MATH  Google Scholar 

  3. Samuel Eilenberg. Automata, Languages and Machines, volume B. Academic Press, New York, 1976.

    MATH  Google Scholar 

  4. Lothaire. Combinatorics on Words, volume 17 of Encyclopedia of Mathematics and. its Applications. aw, reading, 1983.

    MATH  Google Scholar 

  5. Jean-Éric Pin. Polynomial closure of group languages and open sets of the hall topology. Theoretical Computer Science, 169:185–200, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  6. Jean-Eric Pin and Pascal Weil. Polynomial closure and unambiguous product. Theory. Comput. Systems, 30:1–39, 1997.

    Article  MathSciNet  Google Scholar 

  7. Ph. Schnoebelen. Decomposable regular languages and the shuffle operator. EATCS. Bull., (67):283–289, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Sistemas Informáticos y Computación, Universidad Politénica de Valencia, Camino de Vera s/n, P.O. Box: 22012, E-46020, Valencia

    Antonio Cano Gómez

  2. LIAFA, Université Paris VII and CNRS, Case 7014, 2 Place Jussieu, 75251, Paris Cedex 05, France

    Jean-Éric Pin

Authors
  1. Antonio Cano Gómez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean-Éric Pin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Szeged, Árpád tér 2, 6720, Szeged, Hungary

    Zoltán Ésik  & Zoltán Fülöp  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gómez, A.C., Pin, JÉ. (2003). On a Conjecture of Schnoebelen. In: Ésik, Z., Fülöp, Z. (eds) Developments in Language Theory. DLT 2003. Lecture Notes in Computer Science, vol 2710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45007-6_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-45007-6_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40434-7

  • Online ISBN: 978-3-540-45007-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation