Abstract
The types of codes dealt with in detail are prefix codes, suffix codes, and two special classes of biprefix codes called infix codes and outfix codes. Conditions are given under which polynomially bounded D0L languages form codes of each these types. A concept of homomorphism is defined for D0L systems. It is demonstrated that when E is a homomorphic image of a D0L system D and L( E) is infinite, then: If L( E) is a code of any of the types listed above, then L( D) is also a code of the same type. A concept of derivative is defined for D0L systems that is closely related to a special type of homomorphism based on the erasure of finite symbols. Code properties of linearly bounded D0L languages are studied in detail. The results are then extended to apply to polynomially bounded D0L languages through the use of the newly introduced derivative concept. It is shown that for every polynomially bounded D0L language L, L{1} is a communtative equivalent of a prefix code. Every D0L language is shown to be the union of (1) a finite set, (2) a finite number of D0L languages each of which has a singleton as alphabet, and (3) a commutative equivalent of a prefix code.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
