%0 Journal Article
%T Quasitriangular Structure of Myhill每Nerode Bialgebras
%A Robert G. Underwood
%J Axioms
%D 2012
%I MDPI AG
%R 10.3390/axioms1020155
%X In computer science the Myhill每Nerode Theorem states that a set L of words in a finite alphabet is accepted by a finite automaton if and only if the equivalence relation ‵L, defined as x ‵L y if and only if xz ﹋ L exactly when yz ﹋ L, ˋz, has finite index. The Myhill每Nerode Theorem can be generalized to an algebraic setting giving rise to a collection of bialgebras which we call Myhill每Nerode bialgebras. In this paper we investigate the quasitriangular structure of Myhill每Nerode bialgebras.
%K algebra
%K coalgebra
%K bialgebra
%K Myhill每Nerode theorem
%K Myhill每Nerode bialgebra
%K quasitriangular structure
%U http://www.mdpi.com/2075-1680/1/2/155