Skip to main content
Log in

Regular autodense languages

  • Original Article
  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

A regular component is either autodense or anti-autodense. Characterizations of a regular component being a pure autodense language and being a pure autodense code are obtained. A relationship between intercodes and anti-autodense languages is that for an intercode L of index m, L n is an anti-autodense language for every n > m.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Chen, K.-H., Fan, C.-M., Huang, C.C., Shyr, H.J.: Autodense languages and anti-autodense languages. Int. J. Comp. Math. (submitted)

  2. Fan C.-M., Shyr H.J.: Some properties of fibonacci languages. Tamkang J. Math. 27(2), 165–182 (1998)

    MathSciNet  Google Scholar 

  3. Fan, C.-M., Shyr, H.J.: Catenation Closed Pairs and Forest Languages. Words, Semigroups, & Transductions, pp. 115–127. World Scientific, Singapore (2000)

  4. Fan C.-M., Shyr H.J.: δ-Codes and δ-languages. J. Discrete Math. Sci. Cryptogr. 8(3), 381–394 (2005)

    MATH  MathSciNet  Google Scholar 

  5. Chang R.K., Shyr H.J.: Global and coglobal languages. Algebra Coll. 2, 11–22 (1995)

    MathSciNet  Google Scholar 

  6. Hsieh, C.Y., Hsu, S.C., Shyr, H.J.: Some algebraic properties of comma-free codes, vol. 697, pp. 57–65. RIMS Kenkyuroku, Japan (1989)

  7. Lallement G.: Semigroups and combinatorial applications. Wiley, New York (1979)

    MATH  Google Scholar 

  8. Li Z.-Z., Shyr H.J., Tsai Y.S.: Annihilators of bifix codes. Int. J. Comp. Math. 83(1), 81–99 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  9. Lin, Y.Y.: Properties of words and the related homomorphisms. M.S. Thesis, Institute of Applied Mathematics, Chung-Yuan University (1995)

  10. Lyndon R.C., Schützenberger M.P.: On the equation a M = b N c P in a free group. Mich. Math. J. 9, 289–298 (1962)

    Article  MATH  Google Scholar 

  11. Shyr H.J.: Disjunctive languages on a free monoid. Inform. Cont. 34(2), 123–129 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  12. Shyr H.J.: A characterization of dense languages. Semigroup Forum 30, 237–240 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  13. Shyr H.J.: Characterization of right dense languages. Semigroup Forum 33, 23–30 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  14. Shyr H.J.: Free monoids and languages, 3rd edn. Hon Min Book Company, Taichung (2001)

    Google Scholar 

  15. Shyr, H.J., Thierrin, G.: Codes and binary relations. Lecture Notes in Mathematics Springer, Séminare d’Algèbre, Paul Dubreil, Paris, vol. 586, pp. 180–188 (1975–1976)

  16. Shyr H.J., Tsai Y.S.: Note on languages which are dense subsemigroups. Soochow J. Math. 11, 117–122 (1988)

    MathSciNet  Google Scholar 

  17. Shyr H.J., Tseng D.C.: Some properties of dense languages. Soochow J. Math. 10, 127–131 (1984)

    MATH  MathSciNet  Google Scholar 

  18. Shyr H.J., Yu S.S.: Intercodes and some related properties. Soochow J. Math. 16(1), 95–107 (1990)

    MATH  MathSciNet  Google Scholar 

  19. Yu S.S.: A characterization of intercodes. Int. J. Comp. Math. 36, 39–48 (1990)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to C. C. Huang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fan, CM., Huang, C.C. & Shyr, H.J. Regular autodense languages. Acta Informatica 45, 467–477 (2008). https://doi.org/10.1007/s00236-008-0078-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-008-0078-z

Keywords

Navigation