Quasitriangular structure of Myhill-Nerode bialgebras (Q398523)

Summary: 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 \(\sim_L\), defined as \(x\sim_Ly\) if and only if \(xz\in L\) exactly when \(yz\in L\), \(\forall 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.