Advertisement

On Unambiguity of Languages Related to Codes

  • Nguyen Dinh HanEmail author
  • Phan Trung Huy
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 179)

Abstract

We introduce a type of unambiguity of languages, which is closely related to codes and a new classification of languages based on this type of unambiguity. Languages in this classification can be used in the area of cryptography to establish security-enhanced encryption schemata. AnO(n 2) time complexity algorithm of Sardinas-Patterson type is given to determine the unambiguous degree of languages when they are regular.

Keywords

quadratic algorithm language code unambiguous degree monoid 

References

  1. 1.
    Anselmo, M.: A non-ambiguous decomposition of regular languages and factorizing codes. Discrete Applied Mathematics 126(2-3), 129–165 (2003)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Béal, M.-P., Burderi, F., Restivo, A.: Coding Partitions: Regularity, Maximality and Global Ambiguity. In: Harju, T., Karhumäki, J., Lepistö, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 48–59. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  3. 3.
    Berstel, J., Perrin, D.: Theory of Codes. Academic Press Inc., New York (1985)zbMATHGoogle Scholar
  4. 4.
    Bruyère, V.: On maximal codes with bounded synchronization delay. Theoretical Computer Science 204, 11–28 (1998)MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Bruyère, V., Wang, L., Zhang, L.: On completion of codes with finite deciphering delay. Europ. J. Combinatorics 11, 513–521 (1990)zbMATHGoogle Scholar
  6. 6.
    Devolder, J., Latteux, M., Litovsky, I., Staiger, L.: Codes and infinite words. Acta Cybernetica 11(4), 241–256 (1994)MathSciNetzbMATHGoogle Scholar
  7. 7.
    Han, N.D., Huy, P.T., Thang, D.Q.: A Quadratic Algorithm for Testing of Omega-Codes. In: Pan, J.-S., Chen, S.-M., Nguyen, N.T. (eds.) ACIIDS 2012, Part I. LNCS(LNAI), vol. 7196, pp. 338–347. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  8. 8.
    Lallement, G.: Semigroups and Combinational Applications. John Wiley and Sons, Inc. (1979)Google Scholar
  9. 9.
    Vinh, H.N., Han, N.D., Huy, P.T.: Code with bounded product and deciphering delay (in Vietnamese). Journal on Information Technologies and Communications 1(4), 46–56 (2010)Google Scholar
  10. 10.
    Vinh, H.N., Nam, V.T., Huy, P.T.: Codes Base on Unambiguous Products. In: Pan, J.-S., Chen, S.-M., Nguyen, N.T. (eds.) ICCCI 2010. LNCS(LNAI), vol. 6423, pp. 252–262. Springer, Heidelberg (2010)CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2012

Authors and Affiliations

  1. 1.Hung Yen University of Technology and EducationHung YenVietnam
  2. 2.Hanoi University of Science and TechnologyHanoiVietnam

Personalised recommendations