Advertisement

On Languages of Cyclic Words

  • Manfred Kudlek
Part of the Lecture Notes in Computer Science book series (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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)CrossRefGoogle Scholar
  2. 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)CrossRefGoogle Scholar
  3. 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. 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. 5.
    Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (2001)zbMATHGoogle Scholar
  6. 6.
    Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)zbMATHGoogle Scholar
  7. 7.
    Jantzen, M.: Extending Regular Expressions with Iterated Shuffle. Theoretical Computer Sci. 38, 223–247 (1985)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 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. 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)CrossRefGoogle Scholar
  10. 10.
    Kuich, W., Salomaa, A.: Semirings, Automata, Languages. EATCS Monographs on TCS. Springer, Heidelberg (1986)zbMATHGoogle Scholar
  11. 11.
    Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing. New Computing Paradigms. Springer, Heidelberg (1998)zbMATHGoogle Scholar
  12. 12.
    Salomaa, A.: Formal Languages. Academic Press, London (1973)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Manfred Kudlek
    • 1
  1. 1.Fachbereich InformatikUniversität HamburgHamburgGermany

Personalised recommendations