Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2013 (2013), Article ID 691439, 5 pages
http://dx.doi.org/10.1155/2013/691439
Research Article

On the Syntactic Monoids Associated with a Class of Synchronized Codes

School of Mathematics, Yunnan Normal University, Kunming, Yunnan 650500, China

Received 2 October 2013; Accepted 5 December 2013

Academic Editors: A. Assi and G. Bosi

Copyright © 2013 Shou-feng Wang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. Berstel, D. Perrin, and C. Reutenauer, Codes and Automata, Cambridge University Press, Cambridge, Mass, USA, 2010.
  2. D. Long, “On group codes,” Theoretical Computer Science, vol. 163, no. 1-2, pp. 259–267, 1996. View at Google Scholar · View at Scopus
  3. Y. Liu, “Completely simple codes,” Semigroup Forum, vol. 85, pp. 417–438, 2012. View at Publisher · View at Google Scholar · View at Scopus
  4. M. Petrich, C. M. Reis, and G. Thierrin, “The syntactic monoid of the semigroup generated by a maximal prefix code,” Proceedings of the American Mathematical Society, vol. 124, no. 3, pp. 655–663, 1996. View at Google Scholar · View at Scopus
  5. Y. Liu, “Compositions of maximal codes,” Theoretical Computer Science, vol. 411, no. 1, pp. 228–238, 2010. View at Publisher · View at Google Scholar · View at Scopus
  6. M. Petrich and N. R. Reilly, Completely Regular Semigroups, A Wiley-Interscience Publication, John Wiley & Sons, New York, NY, USA, 1999.
  7. M. Petrich, Introduction to Semigroups, Merrill, Columbus, Ohio, USA, 1973.