On Unambiguity of Languages Related to Codes
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.
Keywordsquadratic algorithm language code unambiguous degree monoid
- 8.Lallement, G.: Semigroups and Combinational Applications. John Wiley and Sons, Inc. (1979)Google Scholar
- 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