Abstract
This paper investigates the concepts of relational homomorphisms and their closely associated concepts of generalized congruence relations on automata which are in general incomplete, nondeterministic, and infinite. The concept of generalized isomorphism, which is a natural extension of the isomorphism concept in dealing with nondeterministic automata, is also studied.
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.
