Skip to main content
Log in

Prefix-primitive annihilators of languages under some operations

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

Abstract

This paper studies some properties of prefix-primitive annihilators of languages under the catenation, shuffle product and bi-catenation operations. We prove that for every finite language L under the catenation operation, the left prefix-primitive annihilator of L is not equal to the right prefix-primitive annihilator of L, the left prefix-primitive annihilator of languages is not regular for any finite language, and the left prefix-primitive annihilator of any thin languages is not empty. Moreover, we also characterize the prefix-primitive annihilators of non-empty language under the shuffle product and bi-catenation operations over the alphabet with two letters.

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.

Similar content being viewed by others

References

  1. Berstel J., Perrin D.: Theory of Codes. Academic Press, Orlando (1985)

    MATH  Google Scholar 

  2. De Luca A.: On the combinatorial problems in free monoids. Discret. Math. 38, 207–225 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  3. Eilenberg B.: Automata, Languages and Machines, A. Academic Press, New York (1974)

    Google Scholar 

  4. Fan C.M., Huang C.C.: A note on prefix primitive languages. Acta Inform. 47(7–8), 413–423 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  5. Fan C.M., Huang C.C., Yu S.S.: On n-power prefix languages. Int. J. Comput. Math. 85(5), 703–715 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Fan, C.M., Huang, C.C.: Prefix-primitive annihilators of languages, Proceedings of the 27th Workshop on Combinatorial Mathematics and Computation Theory, Providece University, Taichung, Taiwan, 258-262 (2010)

  7. Huang C.C., Yu S.S., Zhao Y.K.: Prefix primitive languages. J. Inform. Optim. Sci. 25(2), 303–316 (2004)

    MathSciNet  MATH  Google Scholar 

  8. Huang C.C., Zhao Y.K.: A note of P-primitive regular expressions. J. Inform. Optim. Sci. 20(2), 543–552 (2002)

    MathSciNet  Google Scholar 

  9. Ito M., Thierrin G., Yu S.S.: Shuffle-closed languages. Publ. Math. Debrecen. 46(3–4), 1–21 (1995)

    MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    MathSciNet  Google Scholar 

  12. 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 

  13. Shyr H.J., Yu S.S.: Bi-catenation and shuffle product of languages. Acta Inform. 35, 689–707 (1998)

    Article  MathSciNet  Google Scholar 

  14. Shyr H.J.: Free Monoids and Languages. Hon Min Book Company, Taiwan (2001)

    Google Scholar 

  15. Shyr H.J., Yu S.S.: Annihilators of languages. In: Ito, M., Jürgensen, H. (eds) Words, Languages, and Combinatorics II, pp. 406–414. World Scientific Publishing, Singapore (1994)

    Google Scholar 

  16. Yu S.S.: Languages and Codes. Tsang Hai Book Publishing Co., Taiwan (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Cheng-Chih Huang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fan, CM., Huang, CC., Tseng, C.C. et al. Prefix-primitive annihilators of languages under some operations. Acta Informatica 49, 281–293 (2012). https://doi.org/10.1007/s00236-012-0159-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-012-0159-x

Keywords

Navigation