Skip to main content
SpringerLink
Log in
Book cover

International Conference on Language and Automata Theory and Applications

LATA 2008: Language and Automata Theory and Applications pp 476–486Cite as

Length Codes, Products of Languages and Primality

  • Conference paper

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

Abstract

We continue the investigation, [9,11,5,1,2], of representing a language as a catenation of languages, each of which cannot be further decomposed in a nontrivial fashion. We study such prime decompositions, both finite and infinite ones. The notion of a length code, an extension of the notion of a code leads to general results concerning decompositions of star languages. Special emphasis is on the decomposition of regular languages. Also some open problems are mentioned.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Avgustinovich, S.V., Frid, A.: A unique decomposition theorem for factorial languages. Internat. J. Alg. Comp. 15, 149–160 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  2. Czyzowicz, J., Fraczak, W., Pelc, A., Rytter, W.: Linear-time prime decompositions of regular prefix codes. Internat. J. Found. Comp. Sci. 14, 1019–1031 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  3. Daley, M., Domaratzki, M., Salomaa, K.: On the operational orthogonality of languages. In: Proc. Workshop on Language Equations, vol. 44, pp. 43–53. TUCS General Publications (2007)

    Google Scholar 

  4. Frid, A.: Commutation in binary factorial languages. In: Harju, T., Karhumäki, J., Lepistö, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 193–204. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  5. Han, Y.-S., Salomaa, A., Salomaa, K., Wood, D., Yu, S.: Prime decompositions of regular languages. Theor. Comp. Sci. 376, 60–69 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  6. Han, Y.-S., Wang, Y., Wood, D.: Infix-free regular expressions and languages. Internat. J. Found. Comp. Sci. (to appear)

    Google Scholar 

  7. Han, Y.-S., Wood, D.: The generalization of generalized automata: Expression automata. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol. 3317, pp. 156–166. Springer, Heidelberg (2005)

    Google Scholar 

  8. Kunc, M.: The power of commuting with finite sets of words. Theory Comput. Syst. 40, 521–551 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  9. Mateescu, A., Salomaa, A., Yu, S.: Factorizations of languages and commutativity conditions. Acta Cybernetica 15, 339–351 (2002)

    MATH  MathSciNet  Google Scholar 

  10. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, pp. 1–3. Springer, Berlin (1997)

    MATH  Google Scholar 

  11. Salomaa, A., Yu, S.: On the decomposition of finite languages. In: Developments in Language Theory, DLT 1999, pp. 22–31. World Scientific Publ. Co., Singapore (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Turku Centre for Computer Science, Joukahaisenkatu 3-5 B, 20520, Turku, Finland

    Arto Salomaa

  2. School of Computing, Queen’s University, Kingston, Ontario, Canada, K7L 3N6

    Kai Salomaa

  3. Department of Computer Science, University of Western Ontario, London, Ontario, Canada, N6A 5B7

    Sheng Yu

Authors
  1. Arto Salomaa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kai Salomaa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sheng Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Rovira i Virgili University, Plaza Imperial Tàrraco 1, 43005, Tarragona, Spain

    Carlos Martín-Vide

  2. Fachbereich Elektrotechnik/Informatik, Universität Kassel, Wilhelmshöher Allee 73, 34121, Kassel, Germany

    Friedrich Otto

  3. Fachbereich 4, Abteilung Informatik/Wirtschaftsinformatik, Universität Trier, Campus II, Gebäude H, 54286, Trier, Germany

    Henning Fernau

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Salomaa, A., Salomaa, K., Yu, S. (2008). Length Codes, Products of Languages and Primality. In: Martín-Vide, C., Otto, F., Fernau, H. (eds) Language and Automata Theory and Applications. LATA 2008. Lecture Notes in Computer Science, vol 5196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88282-4_43

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88282-4_43

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-88282-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation