Abstract
In this paper, we introduce and study on unambiguous degree of languages, a new concept which fills the gap between code and unambiguity product notions. We can use some languages which are not codes but having finite unambiguous degree large enough for encrypting secret information... We propose algorithms to determine unambiguous degree of regular languages with time complexity O(n4) for the general case of non-deterministic automata, O(n2 logn) for the case of deterministic automata, where n is the number of states of finite automata recognizing these languages.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
