Skip to main content

On Languages of Cyclic Words

  • Chapter
Aspects of Molecular Computing

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

Abstract

Languages of cyclic words and their relation to classical word languages are considered. To this aim, an associative and commutative operation on cyclic words is introduced.

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

Access this chapter

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. Bonizzoni, P., de Felice, C., Mauri, G., Zizza, R.: DNA and Circular Splicing. In: Condon, A., Rozenberg, G. (eds.) DNA 2000. LNCS, vol. 2054, pp. 117–129. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  2. Bonizzoni, P., de Felice, C., Mauri, G., Zizza, R.: Decision Problems for Linear and Circular Splicing Systems. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol. 2450, pp. 7–27. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Ceterchi, R., Krithivasan, K.G.: Simple Circular Splicing Systems. Romanian J. Information Sci. and Technology 6(1-2), 121–134 (2003)

    Google Scholar 

  4. Head, T.: Splicing Schemes and DNA. In: Rozenberg, G., Salomaa, A. (eds.) Lindenmayer Systems; Impacts on Theoretical Computer Science and Developmental Biology, pp. 371–383. Springer, Heidelberg (1992)

    Google Scholar 

  5. Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (2001)

    MATH  Google Scholar 

  6. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  7. Jantzen, M.: Extending Regular Expressions with Iterated Shuffle. Theoretical Computer Sci. 38, 223–247 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  8. Kudlek, M., Mateescu, A.: Mix Operation with Catenation and Shuffle. In: Bozapalidis, S. (ed.) Proceedings of the 3rd International Conference Developments in Language Theory, Aristotle University Thessaloniki, pp. 387–398 (1998)

    Google Scholar 

  9. Kudlek, M., Martín-Vide, C., Păun, G.: Toward FMT (Formal Macroset Theory). In: Calude, C.S., Pun, G., Rozenberg, G., Salomaa, A. (eds.) Multiset Processing. LNCS, vol. 2235, pp. 123–133. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. Kuich, W., Salomaa, A.: Semirings, Automata, Languages. EATCS Monographs on TCS. Springer, Heidelberg (1986)

    MATH  Google Scholar 

  11. Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing. New Computing Paradigms. Springer, Heidelberg (1998)

    MATH  Google Scholar 

  12. Salomaa, A.: Formal Languages. Academic Press, London (1973)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Kudlek, M. (2003). On Languages of Cyclic Words. In: Jonoska, N., Păun, G., Rozenberg, G. (eds) Aspects of Molecular Computing. Lecture Notes in Computer Science, vol 2950. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24635-0_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24635-0_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20781-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics