Abstract
A definition for the concept of the immutability of a language with respect to a binary relation is proposed that extends the recently given definition of the immutability of a code. A polynomial-time decision procedure is then given for deciding immutability when the language is regular and the binary relation is specified by means of a finite transducer. In recent literature immutability has been discussed for finite codes which are subjected to distortions made possible by an explicitly allowed set of character transitions. Such settings are subsumed here by choosing the regular language to be the subsemigroup generated by the given code and by expressing the set of allowed transitions as a finite transducer.
Sign-in/Register to access full text options 
Free) 
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
