Skip to main content
SpringerLink
Log in

A note on autodense related languages

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

Abstract

In this paper, some algebraic properties of autodense languages and pure autodense languages are studied. We also investigate the algebraic properties concerning anti-autodense languages. The family of anti-autodense languages contains infix codes, comma-free codes, and some subfamilies of new codes which are anti-autodense prefix codes, anti-autodense suffix codes and anti-autodense codes. The relationships among these subfamilies of new codes are investigated. The characterization of L n, n ≥ 2, which are anti-autodense is studied.

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

Access this article

Log in via an institution

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. Calude C., Yu S.: Language-theoretic complexity of disjunctive sequences. Discrete Appl. Math. 80, 203–209 (1997)

    Article  MathSciNet  MATH  Google Scholar 

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

  3. Guo Y.Q., Thierrin G., Zhang S.H.: Semaphore codes and ideals. J. Inform. Optim. sci. 9(1), 73–83 (1988)

    MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  5. Hsu S.C., Ito M., Shyr H.J.: Some properties of overlapping order and related languages. Soochow J. Math. 15, 29–45 (1989)

    MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  7. Lallement G.: Semigroups and Combinatorial Applications. Wiley, New York (1979)

    MATH  Google Scholar 

  8. Li Z.-Z., Shyr H.J., Tsai Y.S.: Classifications of dense languages. Acta Inform. 43, 173–194 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  9. Perrin D.: Codes conjugués. Inform. Control 20, 221–231 (1972)

    Article  MathSciNet  Google Scholar 

  10. Rabin M.O., Scott D.: Finite automata and their decision problem. IBM J. Res. Dev. 3, 114–125 (1959)

    Article  MathSciNet  Google Scholar 

  11. Reis C.M., Shyr H.J.: Some properties of disjunctive languages on a free monoid. Inform. Control 37(3), 334–344 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  12. Schützenberger, M.P.: On an application of semigroup methods to some problems in coding. IRE Trans. Inform. Theor. IT-2, 47–60 (1956)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  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., Tsai, Y.S.: Disjunctive context-free languages. In: Proceedings of the International Symposium on the Semigroup Theory, pp. 213–223. Kyoto, Japan (1990)

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

    MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  20. Yu S.S.: Languages and Codes. Tsang Hai Book Publishing Co., Taichung (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Management, National Chin-Yi University of Technology, Taichung, 411, Taiwan

    Chen-Ming Fan

  2. School of Applied Information Sciences, Chung Shan Medical University, Taichung, 402, Taiwan

    C. C. Huang

  3. Information Technology Office, Chung Shan Medical University Hospital, Taichung, 402, Taiwan

    C. C. Huang

  4. Department of Applied Mathematic, National Chung-Hsing University, Taichung, 402, Taiwan

    H. J. Shyr

  5. Liberal Arts Center, Da-Yeh University, Chang-Hwa, 515, Taiwan

    Kuo-Hsiang Chen

Authors
  1. Chen-Ming Fan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. C. Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. H. J. Shyr
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Kuo-Hsiang Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to C. C. Huang.

Additional information

This work was supported by the National Science Council R.O.C. under Grant NSC 98-2115-M-040-001.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fan, CM., Huang, C.C., Shyr, H.J. et al. A note on autodense related languages. Acta Informatica 47, 209–219 (2010). https://doi.org/10.1007/s00236-010-0116-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-010-0116-5

Keywords

Search

Navigation