Skip to main content

Homomorphisms Preserve Some Languages Related to Prefix Codes

  • Conference paper
  • 1671 Accesses

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 163))

Abstract

Let X* be the free monoid on a finite alphabet X. This paper deals with homomorphisms over X* which preserve prefix codes, left singular languages and ρ d  − independent languages. Prefix codes preserving homomorphism which we discuss is a modification in the paper by Shyr and Thierrin in 1977.

This work is supported by a grant from the Applied Basic Research Programs of Science and Technology Department Foundation of Yunnan Province of Chian # 2010CD21.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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. Shyr, H.J.: Free Monoids and Languages, 3rd edn. Hon Min Book Company, Taichung (2001)

    MATH  Google Scholar 

  2. Shyr, H.J., Thierrin, G.: Codes, Languages and MOL Schemes, R.A.I.R.O. Informatique Theorique/ Theoretical Computer Science 1, 293–301 (1977)

    MathSciNet  MATH  Google Scholar 

  3. Cao, C.H., Yang, D.: Noted on Homomorphisms Which Preserve Certain Families of Languages. Southeast Asian Bulletin of Mathematics 29, 415–422 (2005)

    MathSciNet  MATH  Google Scholar 

  4. Li, Z.Z.: Languages preserving homomorphisms, Master Thesis, Institute of Applied Mathematics, Chung-Yuan Christsan University, Chung-Li, Taiwan (2001)

    Google Scholar 

  5. Huang, C.C., Yu, S.S.: Prefix-primitive-preserving homomorphisms. Discrete Math. 308, 1025–1032 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Hsiao, H.K., Yeh, Y.T., Yu, S.S.: Square-free-preserving and primitive-preserving homomorphisms. Acta Math. Hungar 101(1-2), 113–130 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  7. Day, P.H., Shyr, H.J.: Language Defined By Some Partial Orders. Scoochow Journal of Mathematics 9, 53–62 (1983)

    MathSciNet  MATH  Google Scholar 

  8. Lyndon, R.C., Schutzenberger, M.P.: The Equation aM= bNcP in a Free Group. Michigan Mathematics Journal 9, 289–298 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  9. Shyr, H.J., Thierrin, G.: Codes and Binary Relations, Seminaire d’Algebra, Paul Dubreil, Pairs. Lecture Notes of Springer- Verlag, vol. 586, pp. 180–188 (1975-1976)

    Google Scholar 

  10. Cao, C.H.: The Problem of Freedom on Certain Subsemigroups of the Submonoid of Left Singular Languages. International Jouranl of Computer Mathematics 81, 121–132 (2004)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chunhua, C., Jingrong, G., Di, Y., Li, S. (2011). Homomorphisms Preserve Some Languages Related to Prefix Codes. In: Wu, Y. (eds) High Performance Networking, Computing, and Communication Systems. ICHCC 2011. Communications in Computer and Information Science, vol 163. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25002-6_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25002-6_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25001-9

  • Online ISBN: 978-3-642-25002-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics