Abstract
The Myhill–Nerode Theorem states that the equivalence relation ∼ L given by a language L has finite index if and only if L is accepted by a finite automaton. In this paper we give several generalizations of the theorem which are algebraic in nature. In our versions, a finiteness condition involving the action of a semigroup on a certain function plays the role of the finiteness of the index of ∼ L , while various algebraic structures including algebras, coalgebras, and bialgebras play the role of the finite automaton which accepts the language. We develop additional theory concerning the algebraic objects which so arise, and study the minimal ones.
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.
