49
Views
0
CrossRef citations to date
0
Altmetric
Articles

A free monoid containing all strongly Bi-singular languages and non-primitive words

, &
Pages 57-66 | Received 18 Jul 2018, Accepted 18 Jan 2019, Published online: 08 Mar 2019

References

  • J. Bestel and D. Perrin, Theory of Codes, Academic Press, New York, 1985.
  • H.J. Shyr, Free Monoids and Languages, 3rd ed., Hon Min Book Company, Taichung, Taiwan, 2001.
  • H.J. Shyr and Y.S. Tsai, Free submonoids in the monoid of languages, Discrete Math. 181 (1998), pp. 213–222.
  • C.H. Cao, The problem of freedom on certain subsemigroups of the submonoid of left singular languages, Int. J. Comput. Math. 81 (2004), pp. 121–132.
  • H.J. Shyr and F.K. Tu, Local distribution of non-primitive words, Proc. SEAMS Conf. Ordered Structures and Algebra of Computer Languages (1993), pp. 202–217
  • J.L. Lassez, On the structure of systematic prefix codes, Int. J. Comput. Math. 3 (1972), pp. 177–188.
  • H. Jürgensen and S.S. Yu, Relations on free monoids, their independent sets, and codes, Int. J. Comput. Math. 40 (1991), pp. 17–46.
  • C.H. Cao, D. Yang and Y. Liu, Sub-classes of the monoid of left cancellative Languages, Int. J. Comput. Math. 88 (2011), pp. 1619–1628.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.