Skip to main content
SpringerLink
Log in

Prime Decomposition Problem for Several Kinds of Regular Codes

  • Conference paper
Theoretical Aspects of Computing - ICTAC 2006 (ICTAC 2006)

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

Included in the following conference series:

  • 272 Accesses

Abstract

Given a class C of codes. A regular code in C is called prime if it cannot be decomposed as a catenation of at least two non-trivial regular codes in C. The prime decomposition problem for the class C of codes consists in decomposing regular codes in C into prime factors in C. In this paper, a general approach to this problem is proposed, by means of which solutions for the prime decomposition problem are obtained, in a unified way, for several classes of codes. These classes are all subclasses of prefix codes and can be defined by binary relations.

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. Berstel, J., Perrin, D.: Theory of Codes. Academic Press, New York (1985)

    MATH  Google Scholar 

  2. Czyzowicz, J., Fraczak, W., Pelc, A., Rytter, W.: Linear-time prime decomposition of regular prefix codes. Int. J. Found. Comput. Sci. 14, 1019–1032 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  3. Han, Y.-S., Wang, Y., Wood, D.: Infix-free regular expressions and languages. Int. J. Found. Comput. Sci. 17, 379–394 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  4. Han, Y.-S., Wood, D.: Outfix-free regular languages and prime outfix-free decomposition. In: Van Hung, D., Wirsing, M. (eds.) ICTAC 2005. LNCS, vol. 3722, pp. 96–109. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Hung, K.V.: On maximality for some kinds of codes over two-letter alphabets. Acta Math. Vietnam. 31, 17–30 (2006)

    MATH  MathSciNet  Google Scholar 

  6. Hung, K.V., Huy, P.T., Long Van, D.: On some classes of codes defined by binary relations. Acta Math. Vietnam. 29, 163–176 (2004)

    MATH  MathSciNet  Google Scholar 

  7. Hung, K.V., Huy, P.T., Long Van, D.: Codes concerning roots of words. Vietnam J. Math. 32, 345–359 (2004)

    MATH  MathSciNet  Google Scholar 

  8. Hung, K.V., Khang, N.Q.: An embedding algorithm for supercodes and sucypercodes. Vietnam J. Math. 33, 119–206 (2005)

    Google Scholar 

  9. Hopcroft, J., Ullman, J.: Formal Languages and Their Relation to Automata. Addison-Wesley Publishing Company, MA (1969)

    MATH  Google Scholar 

  10. Ito, M., Jürgensen, H., Shyr, H., Thierrin, G.: Outfix and infix codes and related classes of languages. J. Comput., Syst. Sci. 43, 484–508 (1991)

    Article  MATH  Google Scholar 

  11. Ito, M., Thierrin, G.: Congruences, infix and cohesive prefix codes. Theoret. Comput. Sci. 136, 471–485 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  12. Jürgensen, H., Konstantinidis, S.: Codes. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 511–607. Springer, Heidelberg (1997)

    Google Scholar 

  13. Mateescu, A., Salomaa, A., Yu, S.: On the decomposition of finite languages, Technical Report 222, TUCS (1998)

    Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  15. Shyr, H.: Free Monoids and Languages. Hon Min Book Company, Taichung (1991)

    MATH  Google Scholar 

  16. Long Van, D.: On a class of hypercodes. In: Ito, M., Imaoka, T. (eds.) Words, Languages and Combinatorics III, pp. 171–183. World Scientific, Singapore (2003)

    Chapter  Google Scholar 

  17. Long Van, D., Hung, K.V.: An approach to the embedding problem for codes defined by binary relations. In: Proceedings of CAI, Greece, pp. 111–127 (2005)

    Google Scholar 

  18. Long Van, D., Hung, K.V.: Characterizations of some classes of codes defined by binary relations. In: Subramanian, K.G., Rangarajan, K., Mukund, M. (eds.) Formal Models, Languages and Applications, vol. 66, pp. 391–410. World Scientific, Singapore (2006)

    Chapter  Google Scholar 

  19. Long Van, D., Van Hung, K., Huy, P.T.: Codes and length-increasing transitive binary relations. In: Van Hung, D., Wirsing, M. (eds.) ICTAC 2005. LNCS, vol. 3722, pp. 29–48. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Hanoi Pedagogical University No. 2, Vietnam

    Kieu Van Hung

  2. Institute of Mathematics, VAST, Vietnam

    Do Long Van

Authors
  1. Kieu Van Hung
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Do Long Van
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratoire CEDRIC, Conservatoire National des Arts et Métiers, 192 rue Saint Martin, Paris Cedex 03, France

    Kamel Barkaoui

  2. Department of Computer Science, University of York, York, UK

    Ana Cavalcanti

  3. UNU-IIST, Macau SAR, China

    Antonio Cerone

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Van Hung, K., Van, D.L. (2006). Prime Decomposition Problem for Several Kinds of Regular Codes. In: Barkaoui, K., Cavalcanti, A., Cerone, A. (eds) Theoretical Aspects of Computing - ICTAC 2006. ICTAC 2006. Lecture Notes in Computer Science, vol 4281. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11921240_15

Download citation

  • DOI: https://doi.org/10.1007/11921240_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-48815-6

  • Online ISBN: 978-3-540-48816-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation