Skip to main content
SpringerLink
Log in

On a Hierarchy of Languages with Catenation and Shuffle

  • Conference paper
Developments in Language Theory (DLT 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7410))

Included in the following conference series:

Abstract

We present basic structures, normal forms, and a hierarchy of languages based on catenation, shuffle and their iterations, defined by algebraic closure or least fix point solution of equation systems.

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. Câmpeanu, C., Salomaa, K., Vágvölgyi, S.: Shuffle Quotient and Decompositions. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol. 2295, pp. 186–196. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Czaja, L., Kudlek, M.: Language Theoretic Properties of Client/Server Systems. In: Proceedings of CS&P 2011, pp. 79–84 (2011)

    Google Scholar 

  3. Flick, N.E., Kudlek, M.: Formal Languages with Catenation and Shuffle. Technical Report, Fachbereich Informatik, Universität Hamburg, FBI-HH-B 299/12 (2012)

    Google Scholar 

  4. Ginsburg, S.: The Mathematical Theory of Context-free Languages. McGraw-Hill (1966)

    Google Scholar 

  5. Gischer, J.: Shuffle Languages, Petri Nets, and Context-sensitive Grammars. CACM 24(9), 597–605 (1981)

    MathSciNet  MATH  Google Scholar 

  6. Ito, M.: Shuffle Decomposition of Regular Languages. Journal of Universal Computer Science 8(2), 257–259 (2002)

    MathSciNet  Google Scholar 

  7. Ito, M.: Algebraic Theory of Automata and Languages. World Scientific (2004)

    Google Scholar 

  8. Jantzen, M.: Extending Regular Expressions with Iterated Shuffle. Technical Report, FB Informatik, Univ. Hamburg, IfI-HH-B-99/84 (1984)

    Google Scholar 

  9. Jantzen, M.: Extending Regular Expressions with Iterated Shuffle. TCS 38, 223–247 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kudlek, M.: On General Iteration Lemmata for Certain Classes of Word, Trace and Graph Languages. FI 37(4), 413–422 (1999)

    MathSciNet  MATH  Google Scholar 

  11. Kudlek, M.: On Semilinear Sets over Commutative Semirings. FI 79(3-4), 447–452 (2007)

    MathSciNet  MATH  Google Scholar 

  12. Kuich, W., Salomaa, A.: Semirings, Automata, Languages. Springer (1986)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, MIN-Fakultät, Universität Hamburg, Germany

    Nils Erik Flick & Manfred Kudlek

Authors
  1. Nils Erik Flick
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manfred Kudlek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Deptartment of Electrical Engineering, National Taiwan University, 106, Taipei, Taiwan

    Hsu-Chun Yen

  2. Department of Computer Science, University of California, 93106, Santa Barbara, CA, USA

    Oscar H. Ibarra

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Flick, N.E., Kudlek, M. (2012). On a Hierarchy of Languages with Catenation and Shuffle. In: Yen, HC., Ibarra, O.H. (eds) Developments in Language Theory. DLT 2012. Lecture Notes in Computer Science, vol 7410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31653-1_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31653-1_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31652-4

  • Online ISBN: 978-3-642-31653-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation