Abstract
A homomorphism ƒ from the set of words over a finite alphabet Σ 1 to the set of words over another finite alphabet Σ 2 is said to preserve star height if for all regular events R ⊆ Σ 1 * , the star height of R is equal to that of ƒ ( R ). An algorithm is presented for deciding whether an arbitrary homomorphism preserves star height or not: in our result, the injectivity of homomorphisms plays an important role, and it is shown that all homomorphisms which preserve star height are injective.
Sign-in/Register to access full text options 
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.
