Next Article in Journal / Special Issue
The Duality between Corings and Ring Extensions
Previous Article in Journal / Special Issue
Hasse-Schmidt Derivations and the Hopf Algebra of Non-Commutative Symmetric Functions

Axioms 2012, 1(2), 155-172; https://doi.org/10.3390/axioms1020155

Article
Quasitriangular Structure of Myhill–Nerode Bialgebras
Department of Mathematics/Informatics Institute, Auburn University Montgomery, P.O. Box 244023, Montgomery, AL 36124, USA
Received: 20 June 2012; in revised form: 15 July 2012 / Accepted: 17 July 2012 / Published: 24 July 2012

## Abstract

:
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 $x z ∈ L$ exactly when $y z ∈ 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.
Keywords:
algebra; coalgebra; bialgebra; Myhill–Nerode theorem; Myhill–Nerode bialgebra; quasitriangular structure

## 1. Introduction

Let $Σ 0$ be a finite alphabet and let $Σ ^ 0$ denote the set of words formed from the letters in $Σ 0$. Let $L ⊆ Σ ^ 0$ be a language, and let $∼ L$ be the equivalence relation defined as $x ∼ L y$ if and only if $x z ∈ L$ exactly when $y z ∈ L , ∀ z ∈ Σ ^ 0$. The Myhill–Nerode Theorem of computer science states that L is accepted by a finite automaton if and only if $∼ L$ has finite index (cf. [1, 1, Chapter III, §9, Proposition 9.2], [2, §3.4, Theorem 3.9]). In [3, Theorem 5.4] the authors generalize the Myhill–Nerode theorem to an algebraic setting in which 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 a bialgebra plays the role of the finite automaton which accepts the language. We call these bialgebras Myhill–Nerode bialgebras.
The purpose of this paper is to investigate the quasitriangular structure of Myhill–Nerode bialgebras.
By construction, a Myhill–Nerode bialgebra B is cocommutative and finite dimensional over its base field. Thus B admits (at least) the trivial quasitriangular structure $( B , 1 ⊗ 1 )$. We ask: does B (or its linear dual $B *$) have any non-trivial quasitriangular structures?
Towards a solution to this problem, we construct a class of commutative Myhill–Nerode bialgebras and give a complete account of the quasitriangular structure of one of them. We begin with some background information regarding algebras, coalgebras, and bialgebras.

## 2. Algebras, Coalgebras and Bialgebras

Let K be an arbitrary field of characteristic 0 and let A be a vector space over K with scalar product $r a$ for all $r ∈ K$, $a ∈ A$. Scalar product defines two maps $s 1 : K ⊗ A → A$ with $r ⊗ a ↦ r a$ and $s 2 : A ⊗ K → A$ with $a ⊗ r ↦ r a$, for $a ∈ A$, $r ∈ K$. Let $I A : A → A$ denote the identity map. A K-algebra is a triple $( A , m A , η A )$ where $m A : A ⊗ A → A$ is a K-linear map which satisfies
$m A ( I A ⊗ m A ) ( a ⊗ b ⊗ c ) = m A ( m A ⊗ I A ) ( a ⊗ b ⊗ c )$
and $η A : K → A$ is a K-linear map for which
$m A ( I A ⊗ η A ) ( a ⊗ r ) = r a = m A ( η A ⊗ I A ) ( r ⊗ a )$
for all $r ∈ K$, $a , b , c ∈ A$. The map $m A$ is the multiplication map of A and $η A$ is the unit map of A. Condition (1) is the associative property and Condition (2) is the unit property.
We write $m A ( a ⊗ b )$ as $a b$. The element $1 A = η A ( 1 K )$ is the unique element of A for which $a 1 A = a = 1 A a$ for all $a ∈ A$. Let $A , B$ be algebras. An algebra homomorphism from A to B is a K-linear map $ϕ : A → B$ such that $ϕ ( m A ( a 1 ⊗ a 2 ) ) = m B ( ϕ ( a 1 ) ⊗ ϕ ( a 2 ) ) for all a 1 , a 2 ∈ A , and ϕ ( 1 A ) = 1 B .$ In particular, for A to be a subalgebra of B we require $1 A = 1 B$.
For any two vector spaces V, W let $τ : V ⊗ W → W ⊗ V$ denote the twist map defined as $τ ( a ⊗ b ) = b ⊗ a$, for $a ∈ V$, $b ∈ W$. For K-algebras $A , B$, we have that $A ⊗ B$ is a K-algebra with multiplication
$m A ⊗ B : ( A ⊗ B ) ⊗ ( A ⊗ B ) → A ⊗ B$
defined by
$m A ⊗ B ( ( a ⊗ b ) ⊗ ( c ⊗ d ) ) = ( m A ⊗ m B ) ( I A ⊗ τ ⊗ I B ) ( a ⊗ ( b ⊗ c ) ⊗ d ) = ( m A ⊗ m B ) ( ( a ⊗ c ) ⊗ ( b ⊗ d ) ) = a c ⊗ b d$
for $a , c ∈ A$, $b , d ∈ B$. The unit map $η A ⊗ B : K → A ⊗ B$ given as
$η A ⊗ B ( r ) = η A ( r ) ⊗ 1 B$
for $r ∈ K$.
Let C be a K-vector space. A K-coalgebra is a triple $( C , Δ C , ϵ C )$ in which $Δ C : C → C ⊗ C$ is K-linear and satisfies
$( I C ⊗ Δ C ) Δ C ( c ) = ( Δ C ⊗ I C ) Δ C ( c )$
and $ϵ C : C → K$ is K-linear with
$s 1 ( ϵ C ⊗ I C ) Δ C ( c ) = c = s 2 ( I C ⊗ ϵ C ) Δ C ( c )$
for all $c ∈ C$. The maps $Δ C$ and $ϵ C$ are the comultiplication and counit maps, respectively, of the coalgebra C. Condition (3) is the coassociative property and Condition (4) is the counit property.
We use the notation of M. Sweedler [4, §1.2] to write
$Δ C ( c ) = ∑ ( c ) c ( 1 ) ⊗ c ( 2 )$
Note that Condition (4) implies that
$∑ ( c ) ϵ C ( c ( 1 ) ) c ( 2 ) = c = ∑ ( c ) ϵ C ( c ( 2 ) ) c ( 1 )$
Let C be a K-coalgebra. A nonzero element c of C for which $Δ C ( c ) = c ⊗ c$ is a grouplike element of C. If c is grouplike, then
$c = s 1 ( ϵ C ⊗ I C ) Δ C ( c ) = s 1 ( ϵ C ⊗ I C ) ( c ⊗ c ) = ϵ C ( c ) c$
and so, $ϵ C ( c ) = 1$. The grouplike elements of C are linearly independent [4, Proposition 3.2.1].
Let $C , D$ be coalgebras. A K-linear map $ϕ : C → D$ is a coalgebra homomorphism if $( ϕ ⊗ ϕ ) Δ C ( c ) = Δ D ( ϕ ( c ) )$ and $ϵ C ( c ) = ϵ D ( ϕ ( c ) )$ for all $c ∈ C$. The tensor product $C ⊗ D$ of two coalgebras is again a coalgebra with comultiplication map
$Δ C ⊗ D : C ⊗ D → ( C ⊗ D ) ⊗ ( C ⊗ D )$
defined by
$Δ C ⊗ D ( c ⊗ d ) = ( I C ⊗ τ ⊗ I D ) ( Δ C ⊗ Δ D ) ( c ⊗ d ) = ( I C ⊗ τ ⊗ I D ) ( Δ C ( c ) ⊗ Δ D ( d ) ) = ( I C ⊗ τ ⊗ I D ) ( ∑ ( c ) , ( d ) c ( 1 ) ⊗ c ( 2 ) ⊗ d ( 1 ) ⊗ d ( 2 ) ) = ∑ ( c ) , ( d ) c ( 1 ) ⊗ d ( 1 ) ⊗ c ( 2 ) ⊗ d ( 2 )$
for $c ∈ C$, $d ∈ D$. The counit map $ϵ C ⊗ D : C ⊗ D → K$ is defined as
$ϵ C ⊗ D ( c ⊗ d ) = ϵ C ( c ) ϵ D ( d )$
for $c ∈ C$, $d ∈ D$.
A K-bialgebra is a K-vector space B together with maps $m B$, $η B$, $Δ B$, $ϵ B$ for which $( B , m B , η B )$ is a K-algebra and $( B , Δ B , ϵ B )$ is a K-coalgebra and for which $Δ B$ and $ϵ B$ are algebra homomorphisms. Let $B , B ′$ be bialgebras. A K-linear map $ϕ : B → B ′$ is a bialgebra homomorphism if ϕ is both an algebra and coalgebra homomorphism.
A K-Hopf algebra is a bialgebra H together with an additional K-linear map $σ H : H → H$ that satisfies
$m H ( I H ⊗ σ H ) Δ H ( h ) = ϵ H ( h ) 1 H = m H ( σ H ⊗ I H ) Δ H ( h )$
for all $h ∈ H$. The map $σ H$ is the coinverse (or antipode) map and property Condition (6) is the coinverse (or antipode) property. Though we will not consider Hopf algebras here, more details on the subject can be found in [5,6,7,8].
An important example of a K-bialgebra is given as follows. Let G be a semigroup with unity, 1. Let $K G$ denote the semigroup algebra. Then $K G$ is a bialgebra with comultiplication map
$Δ K G : K G → K G ⊗ K G$
defined by $x ↦ x ⊗ x$, for all $x ∈ G$, and counit map $ϵ K G : K G → K$ given by $x ↦ 1$, for all $x ∈ G$. The bialgebra $K G$ is the semigroup bialgebra on G.
Let B be a bialgebra, and let A be an algebra which is a left B-module with action denoted by “·”. Suppose that
$b · ( a a ′ ) = ∑ ( b ) ( b ( 1 ) · a ) ( b ( 2 ) · a ′ )$
and
$b · 1 A = ϵ B ( b ) 1 A$
for all $a , a ′ ∈ A$, $b ∈ B$. Then A is a left B-module algebra. A K-linear map $ϕ : A → A ′$ is a left B-module algebra homomorphism if ϕ is both an algebra and a left B-module homomorphism.
Let C be a coalgebra and a right B-module with action denoted by “·”. Suppose that for all $c ∈ C$, $b ∈ B$,
$Δ C ( c · b ) = ∑ ( c ) , ( b ) c ( 1 ) · b ( 1 ) ⊗ c ( 2 ) · b ( 2 )$
and
$ϵ C ( c · b ) = ϵ C ( c ) ϵ B ( b )$
Then C is a right B-module coalgebra. A K-linear map $ϕ : C → C ′$ is a right B-module coalgebra homomorphism if ϕ is both a coalgebra and a right B-module homomorphism.
Let C be a coalgebra and let $C * = Hom K ( C , K )$ denote the linear dual of C. Then the coalgebra structure of C induces an algebra structure on $C *$.
Proposition 2.1 If C is a coalgebra, then $C *$ is an algebra.
Proof. Recall that C is a triple $( C , Δ C , ϵ C )$ where $Δ C : C → C ⊗ C$ is K-linear and satisfies the coassociativity property, and $ϵ C : C → K$ is K-linear and satisfies the counit property. The dual map of $Δ C$ is a K-linear map
$Δ C * : ( C ⊗ C ) * → C *$
Since $C * ⊗ C * ⊆ ( C ⊗ C ) *$, we define the multiplication map of $C *$, denoted as $m C *$, to be the restriction of $Δ C *$ to $C * ⊗ C *$. For $f , g ∈ C *$, $c ∈ C$,
$( f g ) ( c ) = m C * ( f ⊗ g ) ( c ) = Δ C * ( f ⊗ g ) ( c ) = ( f ⊗ g ) ( Δ C ( c ) ) = ∑ ( c ) f ( c ( 1 ) ) g ( c ( 2 ) )$
The coassociatively property of $Δ C$ yields the associative property of $m C *$. Indeed, for $f , g , h ∈ C *$, $c ∈ C$,
$m C * ( I C * ⊗ m C * ) ( f ⊗ g ⊗ h ) ( c ) = Δ C * ( I C * ⊗ Δ C * ) ( f ⊗ g ⊗ h ) ( c ) = Δ C * ( f ⊗ Δ C * ( g ⊗ h ) ) ( c ) = ( f ⊗ Δ C * ( g ⊗ h ) ) Δ C ( c ) = ∑ ( c ) f ( c ( 1 ) ) Δ C * ( g ⊗ h ) ( c ( 2 ) ) = ∑ ( c ) f ( c ( 1 ) ) ( g ⊗ h ) Δ C ( c ( 2 ) ) = ( f ⊗ g ⊗ h ) ( ∑ ( c ) c ( 1 ) ⊗ Δ C ( c ( 2 ) ) ) = ( f ⊗ g ⊗ h ) ( ∑ ( c ) Δ C ( c ( 1 ) ) ⊗ c ( 2 ) ) by Condition (3) = ∑ ( c ) ( f ⊗ g ) Δ C ( c ( 1 ) ) ⊗ h ( c ( 2 ) ) = ∑ ( c ) Δ C * ( f ⊗ g ) ( c ( 1 ) ) ⊗ h ( c ( 2 ) ) = ( Δ C * ( f ⊗ g ) ⊗ h ) Δ C ( c ) = Δ C * ( Δ C * ( f ⊗ g ) ⊗ h ) ( c ) = Δ C * ( Δ C * ⊗ I C * ) ( f ⊗ g ⊗ h ) ( c ) = m C * ( m C * ⊗ I C * ) ( f ⊗ g ⊗ h ) ( c )$
In addition, the counit map of C dualizes to yield
$ϵ C * : K : = K * → C *$
defined as $ϵ C * ( k ) ( c ) = k ( ϵ ( c ) ) = k ϵ ( c )$. Thus we define the unit map $η C *$ to be $ϵ C *$. One can show that the counit property of $ϵ C$ implies the unit property for $η C *$. To this end, for $f ∈ C *$, $r ∈ K$, $c ∈ C$,
$m C * ( I C * ⊗ η C * ) ( f ⊗ r ) ( c ) = Δ C * ( I C * ⊗ ϵ C * ) ( f ⊗ r ) ( c ) = Δ C * ( f ⊗ ϵ C * ( r ) ) ( c ) = ( f ⊗ ϵ C * ( r ) ) ( Δ C ( c ) ) = ∑ ( c ) f ( c ( 1 ) ) ϵ C * ( r ) ( c ( 2 ) ) = ∑ ( c ) f ( c ( 1 ) ) r ( ϵ C ( c ( 2 ) ) ) = r ∑ ( c ) f ( c ( 1 ) ) ϵ C ( c ( 2 ) ) = r ∑ ( c ) ϵ C ( c ( 2 ) ) f ( c ( 1 ) ) = r ∑ ( c ) f ( ϵ C ( c ( 2 ) ) c ( 1 ) ) = r f ( ∑ ( c ) ϵ C ( c ( 2 ) ) c ( 1 ) ) = r f ( c ) by Condition (5)$
In a similar manner, one obtains
$m C * ( η C * ⊗ I C * ) ( r ⊗ f ) = r f$
Thus $( C * , m C * , η C * )$ is an algebra. Note that $η C * ( 1 K ) ( c ) = ϵ C ( c ) , ∀ c$, and so, $ϵ C$ is the unique element of $C *$ for which $ϵ C f = f = f ϵ C$ for all $f ∈ C *$. ⋄
Let $( A , m A , η A )$ be a K-algebra. Then one may wonder if $A *$ is a K-coalgebra. The multiplication map $m A : A ⊗ A → A$ dualizes to yield $m A * : A * → ( A ⊗ A ) *$. Unfortunately, if A is infinite dimensional over K, then $A * ⊗ A *$ is a proper subset of $( A ⊗ A ) *$, and hence $m A *$ may not induce the required comultiplication map $A * → A * ⊗ A *$.
There is still however a K-coalgebra arising via duality from the algebra A. An ideal I of A is cofinite if $dim ( A / I ) < ∞$. The finite dual $A ∘$ of A is defined as
$A ∘ = { f ∈ A * : f ( I ) = 0 for some cofinite ideal I of A }$
Note that $A ∘$ is the largest subspace W of $A *$ for which $m A * ( W ) ⊆ W ⊗ W$.
Proposition 2.2 If A is an algebra, then $A ∘$ is a coalgebra.
Proof. The proof is similar to the method used in Proposition 2.1. We restrict the map $m A *$ to $A ∘$ to yield the K-linear map $m A * : A ∘ → ( A ⊗ A ) *$. Now by [4, Proposition 6.0.3], $m A * ( A ∘ ) ⊆ A ∘ ⊗ A ∘$. Let $Δ A ∘$ denote the restriction of $m A *$ to $A ∘$. We show that $Δ A ∘$ satisfies the coassociative condition. For $f ∈ A ∘$, $a , b , c ∈ A$, we have
$( I ⊗ Δ A ∘ ) Δ A ∘ ( f ) ( a ⊗ b ⊗ c ) = ( I ⊗ m A * ) m A * ( f ) ( a ⊗ b ⊗ c ) = m A * ( f ) ( ( I ⊗ m A ) ( a ⊗ b ⊗ c ) ) = m A * ( f ) ( a ⊗ b c ) = f ( m A ( a ⊗ b c ) ) = f ( a ( b c ) ) = f ( ( a b ) c ) = f ( m A ( a b ⊗ c ) ) = m A * ( f ) ( a b ⊗ c ) = m A * ( f ) ( ( m A ⊗ I ) ( a ⊗ b ⊗ c ) ) = ( m A * ⊗ I ) m A * ( f ) ( a ⊗ b ⊗ c ) = ( Δ A ∘ ⊗ I ) Δ A ∘ ( f ) ( a ⊗ b ⊗ c )$
For the counit map of $A ∘$, we consider the dual map $η A * : A * → K * : = K$. Now $η A *$ restricts to a map $η A * : A ∘ → K$. We let $ϵ A ∘$ denote the restriction of $η A *$ to $A ∘$. For $f ∈ A ∘$, $r ∈ K$,
$ϵ A ∘ ( f ) ( r ) = f ( η A ( r ) ) = f ( r 1 A ) = r f ( 1 A ) = f ( 1 A ) ( r )$
and so, $ϵ A ∘ ( f ) = f ( 1 A )$. We show that $ϵ A ∘$ satisfies the counit property. First let $s 1 : K ⊗ A ∘ → A ∘$ be defined by the scalar multiplication of $A ∘$. For $f ∈ A ∘$, $r ∈ K$, $a ∈ A$,
$s 1 ( ( ϵ A ∘ ⊗ I ) Δ A ∘ ( f ) ) ( a ) = s 1 ( ( η A * ⊗ I ) m A * ( f ) ) ( a ) = ( η A * ⊗ I ) m A * ( f ) ( s 1 * ( a ) ) = ( η A * ⊗ I ) m A * ( f ) ( 1 ⊗ a ) = m A * ( f ) ( ( η A ⊗ I ) ( 1 ⊗ a ) ) = f ( m A ( η A ⊗ I ) ( 1 ⊗ a ) ) = f ( a )$
In a similar manner, one obtains
$s 2 ( ( I ⊗ ϵ A ∘ ) Δ A ∘ ( f ) ) ( a ) = f ( a )$
where $s 2 : A ∘ ⊗ K → A ∘$ is given by scalar multiplication. Thus $A ∘$ is a coalgebra. ⋄
Proposition 2.3 If B is a bialgebra, then $B ∘$ is a bialgebra.
Proof. As a coalgebra, B is a triple $( B , Δ B , ϵ B )$. By Proposition 2.1, $B *$ is an algebra with maps $m B * = Δ B *$ and $η B * = ϵ B *$. Let $m B ∘$ denote the restriction of $m B *$ to $B ∘ ⊗ B ∘$, and let $η B ∘$ denote the restriction of $η B *$ to $B ∘$. Then the triple $( B ∘ , m B ∘ , η B ∘ )$ is a K-algebra.
As an algebra, B is a triple $( B , m B , η B )$. By Proposition 2.2, $B ∘$ is a coalgebra with maps $Δ B ∘$ and $ϵ B ∘$. It remains to show that $Δ B ∘$ and $ϵ B ∘$ are algebra homomorphisms. First observe that for $f , g ∈ B ∘$, $a , b ∈ B$ one has
$( f g ) ( a ) = m B ∘ ( f ⊗ g ) ( a ) = Δ B * ( f ⊗ g ) ( a ) = ( f ⊗ g ) Δ B ( a )$
and
$Δ B ∘ ( f ) ( a ⊗ b ) = m B * ( f ) ( a ⊗ b ) = f ( m B ( a ⊗ b ) ) = f ( a b )$
We have
$Δ B ∘ ( f g ) ( a ⊗ b ) = ( f g ) ( a b ) = ( f ⊗ g ) ( Δ B ( a b ) ) = ( f ⊗ g ) ( Δ B ( a ) Δ B ( b ) ) = ( f ⊗ g ) ( m B ⊗ B ( Δ B ( a ) ⊗ Δ B ( b ) ) = m B ⊗ B * ( f ⊗ g ) ( Δ B ( a ) ⊗ Δ B ( b ) ) = ( I ⊗ τ ⊗ I ) ( Δ B ∘ ⊗ Δ B ∘ ) ( f ⊗ g ) ( Δ B ( a ) ⊗ Δ B ( b ) ) = ( Δ B ∘ ( f ) ⊗ Δ B ∘ ( g ) ) ( I ⊗ τ ⊗ I ) ( Δ B ⊗ Δ B ) ( a ⊗ b ) = ( Δ B ∘ ( f ) ⊗ Δ B ∘ ( g ) ) ( Δ B ⊗ B ( a ⊗ b ) ) = Δ B ⊗ B * ( Δ B ∘ ( f ) ⊗ Δ B ∘ ( g ) ) ( a ⊗ b ) = m B ∘ ⊗ B ∘ ( Δ B ∘ ( f ) ⊗ Δ B ∘ ( g ) ) ( a ⊗ b ) = ( Δ B ∘ ( f ) Δ B ∘ ( g ) ) ( a ⊗ b )$
and so $Δ B ∘$ is an algebra map. We next show that $ϵ B ∘$ is an algebra map. For $f , g ∈ B ∘$,
$ϵ B ∘ ( f ) = ϵ B ∘ ( f ) ( 1 ) = f ( η B ( 1 ) ) = f ( 1 B )$
Thus
$ϵ B ∘ ( f g ) = ( f g ) ( 1 B ) = f ( 1 B ) g ( 1 B ) = ϵ B ∘ ( f ) ϵ B ∘ ( g )$
and so, $ϵ B ∘$ is an algebra map. ⋄
Proposition 2.4 Suppose that B is a bialgebra that is finite dimensional over K. Then $B *$ is a bialgebra.
Proof. If $dim ( B ) < ∞$, then $B ∘ = B *$. The result then follows from Proposition 2.3. ⋄
Let $G = { x 1 , x 2 , ⋯ , x n }$ be a finite semigroup with unity element $1 K G = x 1$, and let $K G$ denote the semigroup bialgebra. By Proposition 2.4 $K G *$ is a bialgebra of dimension n over K. Let ${ e 1 , e 2 , ⋯ , e n }$ be the dual basis for $K G *$ defined as $e i ( x j ) = δ i , j$.
Proposition 2.5 The comultiplication map $Δ K G * : K G * → K G * ⊗ K G *$ is given as
$Δ K G * ( e i ) = ∑ x i = x j x k e j ⊗ e k$
and the counit map $ϵ K G * : K G * → K$ is defined as $ϵ K G * ( e i ) = e i ( x 1 ) = δ i , 1$.
Proof, See [7, (1.3.7)]. ⋄
Let B be a K-bialgebra. Then B is cocommutative if
$τ ( Δ B ( b ) ) = Δ B ( b )$
for all $b ∈ B$.
Proposition 2.6 If B is cocommutative, then $B ∘$ is a commutative algebra. If B is a commutative algebra, then $B ∘$ is cocommutative.
Proof. See [7, Lemma 1.2.2, Proposition 1.2.4]. ⋄

## 3. Quasitriangular Bialgebras

Let B be a bialgebra and let $B ⊗ B$ be the tensor product algebra. Let $U ( B ⊗ B )$ denote the group of units in $B ⊗ B$ and let $R ∈ U ( B ⊗ B )$. The pair $( B , R )$ is almost cocommutative if the element R satisfies
$τ ( Δ B ( b ) ) = R Δ B ( b ) R - 1$
for all $b ∈ B$.
If the bialgebra B is cocommutative, then the pair $( B , 1 ⊗ 1 )$ is almost cocommutative since $R = 1 ⊗ 1$ satisfies Condition (7). However, if B is commutative and non-cocommutative, then $( B , R )$ cannot be almost cocommutative for any $R ∈ U ( B ⊗ B )$ since Condition (7) in this case reduces to the condition for cocommutativity.
Write $R = ∑ i = 1 n a i ⊗ b i ∈ U ( B ⊗ B )$. Let
$R 12 = ∑ i = 1 n a i ⊗ b i ⊗ 1 ∈ B ⊗ B ⊗ B$
$R 13 = ∑ i = 1 n a i ⊗ 1 ⊗ b i ∈ B ⊗ B ⊗ B$
$R 23 = ∑ i = 1 n 1 ⊗ a i ⊗ b i ∈ B ⊗ B ⊗ B$
The pair $( B , R )$ is quasitriangular if $( B , R )$ is almost cocommutative and the following conditions hold
$( Δ B ⊗ I ) R = R 13 R 23$
$( I ⊗ Δ B ) R = R 13 R 12$
Clearly, if B is cocommutative then $( B , 1 ⊗ 1 )$ is quasitriangular.
Let B be a bialgebra. A quasitriangular structure is an element $R ∈ U ( B ⊗ B )$ so that $( B , R )$ is quasitriangular. Let $( B , R )$ and $( B ′ , R ′ )$ be quasitriangular bialgebras. Then $( B , R )$, $( B ′ , R ′ )$ are isomorphic as quasitriangular bialgebras if there exists a bialgebra isomorphism $ϕ : B → B ′$ for which $R ′ = ( ϕ ⊗ ϕ ) ( R )$. Two quasitriangular structures $R , R ′$ on a bialgebra B are equivalent quasitriangular structures if $( B , R ) ≅ ( B , R ′ )$ as quasitriangular bialgebras.
The following proposition shows that every bialgebra isomorphism $ϕ : B → B ′$ with B quasitriangular extends to an isomorphism of quasitriangular bialgebras.
Proposition 3.1 Suppose $( B , R )$ is quasitriangular and suppose that $ϕ : B → B ′$ is an isomorphism of K-bialgebras. Let $R ′ = ( ϕ ⊗ ϕ ) ( R )$. Then $( B ′ , R ′ )$ is quasitriangular.
Proof. Note that $( ϕ ⊗ ϕ ) ( R - 1 ) = ( ( ϕ ⊗ ϕ ) ( R ) ) - 1$. Let $b ′ ∈ B ′$. Then there exists $b ∈ B$ for which $ϕ ( b ) = b ′$. Now
$τ Δ B ′ ( b ′ ) = τ Δ B ′ ( ϕ ( b ) ) = τ ( ϕ ⊗ ϕ ) Δ B ( b ) = ( ϕ ⊗ ϕ ) τ Δ B ( b ) = ( ϕ ⊗ ϕ ) ( R Δ B ( b ) R - 1 ) = ( ϕ ⊗ ϕ ) ( R ) ( ϕ ⊗ ϕ ) Δ B ( b ) ( ϕ ⊗ ϕ ) ( R - 1 ) = ( ϕ ⊗ ϕ ) ( R ) Δ B ′ ( ϕ ( b ) ) ( ( ϕ ⊗ ϕ ) ( R ) ) - 1 = ( ϕ ⊗ ϕ ) ( R ) Δ B ′ ( b ′ ) ( ( ϕ ⊗ ϕ ) ( R ) ) - 1 = R ′ Δ B ′ ( b ′ ) ( R ′ ) - 1$
and so, $( B , R ′ )$ is almost cocommutative. Moreover,
$( Δ B ′ ⊗ I ) ( R ′ ) = ( Δ B ′ ⊗ I ) ( ϕ ⊗ ϕ ) ( R ) = ( Δ B ′ ⊗ I ) ( ∑ i = 1 n ϕ ( a i ) ⊗ ϕ ( b i ) ) = ∑ i = 1 n Δ B ′ ϕ ( a i ) ⊗ ϕ ( b i ) ) = ∑ i = 1 n ( ϕ ⊗ ϕ ) Δ B ( a i ) ⊗ ϕ ( b i ) ) = ( ϕ ⊗ ϕ ⊗ ϕ ) ( ∑ i = 1 n Δ B ( a i ) ⊗ b i ) = ( ϕ ⊗ ϕ ⊗ ϕ ) ( Δ B ⊗ I ) ( R ) = ( ϕ ⊗ ϕ ⊗ ϕ ) ( R 13 R 23 ) = ( ϕ ⊗ ϕ ⊗ ϕ ) ( ( ∑ i = 1 n a i ⊗ 1 ⊗ b i ) ( ∑ i = 1 n 1 ⊗ a i ⊗ b i ) ) = ( ∑ i = 1 n ϕ ( a i ) ⊗ 1 ⊗ ϕ ( b i ) ) ( ∑ i = 1 n 1 ⊗ ϕ ( a i ) ⊗ ϕ ( b i ) ) = ( ( ϕ ⊗ ϕ ) ( R ) ) 13 ( ( ϕ ⊗ ϕ ) ( R ) ) 23 = ( R ′ ) 13 ( R ′ ) 23$
In a similar manner one shows that
$( I ⊗ Δ B ′ ) ( R ′ ) = ( R ′ ) 13 ( R ′ ) 12$
Thus $( B ′ , R ′ )$ is quasitriangular. ⋄
Quasitriangular bialgebras are important since they give rise to solutions of the equation
$R 12 R 13 R 23 = R 23 R 13 R 12$
which is known as the quantum Yang–Baxter equation (QYBE). The QYBE was first introduced in statistical mechanics, see . An element $R ∈ B ⊗ B$ which satisfies (10) is a solution to the QYBE.
Certainly, the QYBE admits the trivial solution $R = 1 ⊗ 1$, and of course, if B is commutative, then any $R ∈ B ⊗ B$ is a solution to the QYBE. For B non-commutative, it is of great interest to find non-trivial solutions $R ∈ B ⊗ B$ to the QYBE. We have the following result due to V. G. Drinfeld .
Proposition 3.2 (Drinfeld) Suppose $( B , R )$ is quasitriangular. Then R is a solution to the QYBE.
Proof. One has
$R 12 R 13 R 23 = R 12 ( Δ ⊗ I ) ( R ) by (8) = ( R ⊗ 1 ) ( ∑ i = 1 n Δ ( a i ) ⊗ b i ) = ∑ i = 1 n R Δ ( a i ) ⊗ b i = ∑ i = 1 n τ Δ ( a i ) R ⊗ b i by (7) = ( ∑ i = 1 n τ Δ ( a i ) ⊗ b i ) ( R ⊗ 1 ) = ( τ Δ ⊗ I ) ( R ) R 12 = ( τ ⊗ I ) ( Δ ⊗ I ) ( R ) R 12 = ( τ ⊗ I ) ( R 13 R 23 ) R 12 by (8) = R 23 R 13 R 12$
The following proposition provides necessary conditions on $R ∈ U ( B ⊗ B )$ in order for $( B , R )$ to be quasitriangular.
Proposition 3.3 Suppose $( B , R )$ is quasitriangular. Then
(i) $s 1 ( ϵ ⊗ I ) ( R ) = 1$,
(ii) $s 2 ( I ⊗ ϵ ) ( R ) = 1$.
Proof. For (i) one has
$( s 1 ⊗ I ) ( ϵ ⊗ I ⊗ I ) ( Δ ⊗ I ) ( R ) = ( s 1 ⊗ I ) ( ϵ ⊗ I ⊗ I ) ( ∑ i = 1 n Δ ( a i ) ⊗ b i ) = ( s 1 ⊗ I ) ( ∑ i = 1 n ( ϵ ⊗ I ) Δ ( a i ) ⊗ b i ) = ∑ i = 1 n s 1 ( ϵ ⊗ I ) Δ ( a i ) ⊗ b i = ∑ i = 1 a i ⊗ b i = R$
In view of Condition (8)
$R = ( s 1 ⊗ I ) ( ϵ ⊗ I ⊗ I ) ( R 13 R 23 ) = ( s 1 ⊗ I ) ( ϵ ⊗ I ⊗ I ) ( R 13 ) ( s 1 ⊗ I ) ( ϵ ⊗ I ⊗ I ) ( R 23 ) = ( s 1 ⊗ I ) ( ϵ ⊗ I ⊗ I ) ( ∑ i = 1 n a i ⊗ 1 ⊗ b i ) ( s 1 ⊗ I ) ( ϵ ⊗ I ⊗ I ) ( ∑ i = 1 n 1 ⊗ a i ⊗ b i ) = ( ∑ i = 1 n ϵ ( a i ) 1 ⊗ b i ) ( ∑ i = 1 n a i ⊗ b i ) = ( ∑ i = 1 n 1 ⊗ ϵ ( a i ) b i ) R$
Thus
$1 ⊗ ∑ i = 1 ϵ ( a i ) b i = 1 ⊗ 1$
and consequently,
$1 = s 1 ( ∑ i = 1 n ϵ ( a i ) ⊗ b i ) = s 1 ( ϵ ⊗ I ) ( R )$
A similar argument is used to prove (ii). ⋄

## 4. Myhill–Nerode Bialgebras

In this section we review the main result of  in which the authors give a bialgebra version of the Myhill–Nerode Therorem. Let G be a semigroup with unity, 1 and let $H = K G$ be the semigroup bialgebra. There is a right H-module structure on $H *$ defined as
$( p ↼ x ) ( y ) = p ( x y )$
for all $x , y ∈ H$, $p ∈ H *$. For $x ∈ H$, $p ∈ H *$, the element $p ↼ x$ is the right translate of p by x.
Proposition 4.1 ([3, Proposition 5.4].) Let G be a semigroup with 1, let $H = K G$ denote the semigroup bialgebra. Let $p ∈ H *$. Then the following are equivalent.
(i) The set ${ p ↼ x : x ∈ G }$ of right translates is finite.
(ii) There exists a finite dimensional bialgebra B, a bialgebra homomorphism $Ψ : H → B$, and an element $f ∈ B *$ so that $p ( h ) = f ( Ψ ( h ) )$ for all $h ∈ H$.
(Note: The bialgebras of (ii) are defined to be Myhill–Nerode bialgebras.)
Proof. $( i ) ⟹ ( i i )$. Let $Q = { p ↼ x : x ∈ G }$ be the finite set of right translates. For each $u ∈ G$, we define a right operator $r u : Q → Q$ by the rule
$( p ↼ x ) r u = ( p ↼ x ) ↼ u = p ↼ x u$
Observe that the set ${ r u : u ∈ G }$ is finite with $| { r u : u ∈ G } | ≤ | Q | | Q |$. The set ${ r u : u ∈ G }$ is a semigroup with unity, $1 = r 1$ under composition of operators. Indeed,
$( p ↼ x ) ( r u r v ) = ( p ↼ x u ) r v = p ↼ x u v = ( p ↼ x ) r u v$
Thus $r u r v = r u v$, for all $u , v ∈ G$. Let B denote the semigroup bialgebra on ${ r u : u ∈ G }$. Let $Ψ : H → B$ be the K-linear map defined by $Ψ ( u ) = r u$. Then
$Ψ ( u v ) = r u v = r u r v = Ψ ( u ) Ψ ( v )$
and
$Δ B ( Ψ ( u ) ) = Δ B ( r u ) = r u ⊗ r u = Ψ ( u ) ⊗ Ψ ( v ) = ( Ψ ⊗ Ψ ) ( u ⊗ u ) = ( Ψ ⊗ Ψ ) Δ H ( u )$
and so, Ψ is a homomorphism of bialgebras.
Let $f ∈ B *$ be defined by
$f ( r u ) = ( ( p ↼ 1 ) r u ) ( 1 ) = ( p ↼ u ) ( 1 ) = p ( u )$
Then $p ( h ) = f ( Ψ ( h ) )$, for all $h ∈ H$, as required.
$( i i ) ⟹ ( i )$. Suppose there exists a finite dimensional bialgebra B, a bialgebra homomorphism $Ψ : H → B$, and an element $f ∈ B *$ so that $p ( h ) = f ( Ψ ( h ) )$ for all $h ∈ H$. Define a right H-module action · on B as
$b · h = b Ψ ( h )$
for all $b ∈ B$, $h ∈ H$. Then for $b ∈ B$, $x ∈ G$,
$Δ B ( b · x ) = Δ B ( b Ψ ( x ) ) = Δ B ( b ) Δ B ( Ψ ( x ) ) = ( ∑ ( b ) b ( 1 ) ⊗ b ( 2 ) ) ( Ψ ⊗ Ψ ) Δ H ( x ) = ( ∑ ( b ) b ( 1 ) ⊗ b ( 2 ) ) ( Ψ ( x ) ⊗ Ψ ( x ) ) = ∑ ( b ) b ( 1 ) Ψ ( x ) ⊗ b ( 2 ) Ψ ( x ) = ∑ ( b ) b ( 1 ) · x ⊗ b ( 2 ) · x$
and
$ϵ B ( b · x ) = ϵ B ( b Ψ ( x ) ) = ϵ B ( b ) ϵ B ( Ψ ( x ) ) = ϵ B ( b ) ϵ H ( x )$
Thus B is a right H-module coalgebra.
Now, let Q be the collection of grouplike elements of B. Since Q is a linearly independent subset of B and B is finite dimensional, Q is finite. Since B is a right H-module coalgebra with action “·”,
$Δ B ( q · x ) = q · x ⊗ q · x$
for $q ∈ Q$, $x ∈ G$. Thus · restricts to give an action (also denoted by “·”) of G on Q. Now for $x , y ∈ G$,
$( p ↼ x ) ( y ) = p ( x y ) = f ( Ψ ( x y ) ) = f ( Ψ ( x ) Ψ ( y ) ) = f ( ( 1 B Ψ ( x ) ) Ψ ( y ) ) = f ( ( 1 B · x ) · y )$
Let
$S = { q ∈ Q : q = 1 B · x for some x ∈ G }$
In view of Condition (11) there exists a function
$ϱ : S → { p ↼ x : x ∈ G }$
defined as
$ϱ ( 1 B · x ) ( y ) = f ( ( 1 B · x ) · y ) = ( p ↼ x ) ( y )$
Since ϱ is surjective and S is finite, ${ p ↼ x : x ∈ G }$ is finite. ⋄
We illustrate the connection between Proposition 4.1 and the usual Myhill–Nerode Theorem. Let $Σ ^ 0$ denote the set of words in a finite alphabet $Σ 0$. Let $L ⊆ Σ ^ 0$ be a language. Suppose that the equivalence relation $∼ L$ (as in the Introduction) has finite index. Then the usual Myhill–Nerode Theorem says that there exists a finite automaton which accepts L. We show how to construct this finite automaton using Proposition 4.1.
Consider $G = Σ ^ 0$ as a semigroup with unity where the semigroup operation is concatenation and the unity element is the empty word. Let $H = K G$ denote the semigroup bialgebra. Then the characteristic function of L extends to an element $p ∈ H *$. Since $∼ L$ has finite index, the set of right translates ${ p ↼ x : x ∈ G }$ is finite [3, Proposition 2.3]. Now Proposition 4.1 (i)⟹ (ii) applies to show that there exists a finite dimensional bialgebra B, a bialgebra homomorphism $Ψ : H → B$ and an element $f ∈ B *$ so that $p ( h ) = f ( Ψ ( h ) )$, for all $h ∈ H$.
This bialgebra determines a finite automaton $〈 Q , Σ , δ , q 0 , F 〉$, where Q is the finite set of states, Σ is the input alphabet, δ is the transition function, $q 0$ is the initial state, and F is the set of final states (see [2, Chapter 2] for details on finite automata.)
For the states of the automata, we let Q be the (finite) set of grouplike elements of B. For the input alphabet, we choose $Σ = Σ 0$. As we have seen, the right H-module structure of B restricts to an action “·” of G on Q, and so we define the transition function $δ : Q × Σ 0 → Q$ by the rule $δ ( q , x ) = q · x$, for $q ∈ Q$, $x ∈ Σ 0$. The initial state is $q 0 = 1 B$, and the set of final states F is the subset of Q of the form $1 B · x$, $x ∈ G$ for which
$p ( x ) = f ( Ψ ( x ) ) = f 1 B Ψ ( x ) ) = f ( 1 B · x ) = 1$
By construction, the finite automaton $〈 Q , Σ 0 , δ , 1 B , F 〉$ accepts L.

## 5. Quasitriangular Structure of Myhill–Nerode Bialgebras

In this section we use Proposition 4.1 to construct a collection of Myhill–Nerode bialgebras. We then compute the quasitriangular structure of one of these bialgebras.
Let $Σ 0 = { a }$ be the alphabet on a single letter a. Let $Σ ^ 0 = { 1 , a , a a , a a a , ⋯ }$ denote the collection of all words of finite length formed from $Σ 0$. Here 1 denotes the empty word of length 0. For convenience, we shall write
$a i = a a a ⋯ a ︸ i times ,$
for $i ≥ 0$.
Fix an integer $i ≥ 0$ and let $L i = { a i } ⊆ Σ ^ 0$. Then the language $L i$ is accepted by the finite automaton given in Figure 1.
Figure 1. Finite automaton accepting $L i = { a i }$, accepting state is i.
Figure 1. Finite automaton accepting $L i = { a i }$, accepting state is i.
By the usual Myhill–Nerode Theorem, the equivalence relation $∼ L i$, defined as $x ∼ L i y$ if and only if $x z ∈ L i$ exactly when $y z ∈ L i , ∀ z$, has finite index. If $p i : Σ ^ 0 → { 0 , 1 } ⊆ K$ is the characteristic function of $L i$, then $∼ L i$ is equivalent to the relation $∼ p i$ defined as: $x ∼ p i y$ if and only if $p i ( x z ) = p i ( y z ) , ∀ z ∈ Σ ^ 0$. Let $[ x ] p i$ denote the equivalence class of x under $∼ p i$. The Myhill–Nerode theorem now says that the set ${ [ x ] p i : x ∈ Σ ^ 0 }$ is finite.
Now we consider $G = Σ ^ 0$ as a semigroup with unity 1 with concatenation as the binary operation. Let $H = K G$ be the semigroup bialgebra. The characteristic function $p i$ of $L i$ extends to an element of $H *$. By [3, Proposition 2.3], the set of right translates ${ p i ↼ x : x ∈ G }$ is finite. Thus by Proposition 4.1, there exists a finite dimensional bialgebra $B i$, a bialgebra homomorphism $Ψ : H → B i$, and an element $f i ∈ B i *$ so that $p i ( h ) = f i ( Ψ ( h ) )$ for all $h ∈ H$.
In what follows, we give the bialgebra structure of the collection ${ B i : i ≥ 0 }$ and compute the quasitriangular structure of the bialgebra $B 0$.
For $i ≥ 0$, the finite set of right translates of $p i ∈ H *$ is
$Q i = { p i ↼ 1 , p i ↼ a , p i ↼ a 2 , ⋯ , p i ↼ a i , p i ↼ a i + 1 }$
One finds that the set of right operators on $Q i$ is ${ r 1 , r a , r a 2 , ⋯ , r a i , r a i + 1 }$. Under composition, the set of right operators is a semigroup with unity $r 1$. We have, for $0 ≤ m , n ≤ i + 1$,
By construction, $B i$ is the semigroup bialgebra on ${ r 1 , r a , r a 2 , ⋯ , r a i , r a i + 1 }$.

#### 5.1. Quasitriangular Structure of $B 0$

In the case $i = 0$, $B 0$ is the semigroup bialgebra on ${ r 1 , r a }$ with algebra structure defined by $r 1 r 1 = r 1$, $r 1 r a = r a$, $r a r 1 = r a$, $r a r a = r a$. Let ${ e 0 , e 1 }$ be the dual basis defined as $e 0 ( r 1 ) = 1$, $e 0 ( r a ) = 0$, $e 1 ( r 1 ) = 0$, $e 1 ( r a ) = 1$. Then ${ e 0 , e 1 }$ is the set of minimal idempotents for $B 0 *$. Comultiplication on $B 0 *$ is given as
$Δ B 0 * ( e 0 ) = e 0 ⊗ e 0$
$Δ B 0 * ( e 1 ) = e 0 ⊗ e 1 + e 1 ⊗ e 0 + e 1 ⊗ e 1$
and the counit map is defined by
$ϵ B 0 * ( e 0 ) = 1 , ϵ B 0 * ( e 1 ) = 0$
Proposition 5.1 Let $B 0$ be the K-bialgebra as above. Then there is exactly one quasitriangular structure on $B 0$, namely, $R = 1 B 0 ⊗ 1 B 0$.
Proof. Certainly, $1 ⊗ 1 = 1 B 0 ⊗ 1 B 0$ is a quasitriangular structure for $B 0$. We claim that $1 ⊗ 1$ is the only quasitriangular structure. Observe that there is bialgebra isomorphism $ϕ : B 0 → B 0 *$ defined as $ϕ ( r 1 ) = e 0 + e 1$, $ϕ ( r a ) = e 0$. Thus if $( B 0 , R )$ is quasitriangular, then $( B 0 * , R ′ )$, $R ′ = ( ϕ ⊗ ϕ ) ( R )$, is quasitriangular by Proposition 3.1. So, we first compute all of the quasitriangular structures of $B 0 *$. To this end, suppose that $( B 0 * , R ′ )$ is quasitriangular for some element $R ′ ∈ B 0 * ⊗ B 0 *$. Since
$B 0 * ⊗ B 0 * = K ( e 0 ⊗ e 0 ) ⊕ K ( e 0 ⊗ e 1 ) ⊕ K ( e 1 ⊗ e 0 ) ⊕ K ( e 1 ⊗ e 1 )$
$R ′ = w ( e 0 ⊗ e 0 ) + x ( e 0 ⊗ e 1 ) + y ( e 1 ⊗ e 0 ) + z ( e 1 ⊗ e 1 )$
for $w , x , y , z ∈ K$. By Proposition 3.3(i),
$1 B 0 * = e 0 + e 1 = s 1 ( ϵ ⊗ I ) ( w ( e 0 ⊗ e 0 ) + x ( e 0 ⊗ e 1 ) + y ( e 1 ⊗ e 0 ) + z ( e 1 ⊗ e 1 ) ) = w e 0 + x e 1$
and so, $w = x = 1$. From Proposition 3.3(ii), one also has $y = 1$. Thus
$R ′ = e 0 ⊗ e 0 + e 0 ⊗ e 1 + e 1 ⊗ e 0 + z ( e 1 ⊗ e 1 )$
for $z ∈ K$. Now,
$( Δ ⊗ I ) ( R ′ ) = ( Δ ⊗ I ) ( e 0 ⊗ e 0 + e 0 ⊗ e 1 + e 1 ⊗ e 0 + z ( e 1 ⊗ e 1 ) ) = ( e 0 ⊗ e 0 ) ⊗ e 0 + ( e 0 ⊗ e 0 ) ⊗ e 1 + ( e 0 ⊗ e 1 + e 1 ⊗ e 0 + e 1 ⊗ e 1 ) ⊗ e 0 + z ( ( e 0 ⊗ e 1 + e 1 ⊗ e 0 + e 1 ⊗ e 1 ) ⊗ e 1 ) = e 0 ⊗ e 0 ⊗ e 0 + e 0 ⊗ e 0 ⊗ e 1 + e 0 ⊗ e 1 ⊗ e 0 + e 1 ⊗ e 0 ⊗ e 0 + e 1 ⊗ e 1 ⊗ e 0 + z ( e 0 ⊗ e 1 ⊗ e 1 ) + z ( e 1 ⊗ e 0 ⊗ e 1 ) + z ( e 1 ⊗ e 1 ⊗ e 1 )$
Moreover,
$( R ′ ) 13 ( R ′ ) 23 = ( e 0 ⊗ ( e 0 + e 1 ) ⊗ e 0 + e 0 ⊗ ( e 0 + e 1 ) ⊗ e 1 + e 1 ⊗ ( e 0 + e 1 ) ⊗ e 0 + z ( e 1 ⊗ ( e 0 + e 1 ) ⊗ e 1 ) ) · ( ( e 0 + e 1 ) ⊗ e 0 ⊗ e 0 + ( e 0 + e 1 ) ⊗ e 0 ⊗ e 1 + ( e 0 + e 1 ) ⊗ e 1 ⊗ e 0 + z ( ( e 0 + e 1 ) ⊗ e 1 ⊗ e 1 ) ) = ( e 0 ⊗ e 0 ⊗ e 0 + e 0 ⊗ e 1 ⊗ e 0 + e 0 ⊗ e 0 ⊗ e 1 + e 0 ⊗ e 1 ⊗ e 1 + e 1 ⊗ e 0 ⊗ e 0 + e 1 ⊗ e 1 ⊗ e 0 + z ( e 1 ⊗ e 0 ⊗ e 1 ) + z ( e 1 ⊗ ⊗ e 1 ⊗ e 1 ) ) · ( e 0 ⊗ e 0 ⊗ e 0 + e 1 ⊗ e 0 ⊗ e 0 + e 0 ⊗ e 0 ⊗ e 1 + e 1 ⊗ e 1 ⊗ e 0 + e 0 ⊗ e 1 ⊗ e 0 + e 1 ⊗ e 1 ⊗ e 0 + z ( e 0 ⊗ e 1 ⊗ e 1 ) + z ( e 1 ⊗ ⊗ e 1 ⊗ e 1 ) ) = e 0 ⊗ e 0 ⊗ e 0 + e 0 ⊗ e 1 ⊗ e 0 + e 0 ⊗ e 0 ⊗ e 1 + z ( e 0 ⊗ e 1 ⊗ e 1 ) + e 1 ⊗ e 0 ⊗ e 0 + e 1 ⊗ e 1 ⊗ e 0 + z ( e 1 ⊗ e 0 ⊗ e 1 ) + z 2 ( e 1 ⊗ e 1 ⊗ e 1 )$
Equations 12 and 13 yield the relation $z 2 = z$. Thus either $z = 0$ or $z = 1$. If $z = 0$, then $R ′$ is not a unit in $B 0 * ⊗ B 0 *$. Thus
$R ′ = e 0 ⊗ e 0 + e 0 ⊗ e 1 + e 1 ⊗ e 0 + e 1 ⊗ e 1 = 1 ⊗ 1$
is the only quasitriangular structure for $B 0 *$.
Consequently, if $( B 0 , R )$ is quasitriangular, then $( ϕ ⊗ ϕ ) ( R ) = 1 B 0 * ⊗ 1 B 0 *$. It follows that $R = 1 B 0 ⊗ 1 B 0$. ⋄

#### 5.2. Questions for Future Research

Though the Myhill–Nerode bialgebra $B 0$ has only the trivial quasitriangular structure, it remains to compute the quasitriangular structure of $B i$ for $i ≥ 1$. Moreover, the linear dual $B i *$ is a commutative, cocommutative K-bialgebra and it would be of interest to find its quasitriangular structure. Unlike the $i = 0$ case, we may have $B i ≅ B i *$ (for instance, $B 1 ≅ B 1 *$) and so this is indeed a separate problem.
Suppose that L is a language of words built from the alphabet $Σ 0 = { a , b }$. If L is accepted by a finite automaton, then by Proposition 4.1, L gives rise to a Myhill–Nerode bialgebra B (see for example, [3, §6].) By construction, B is a cocommutative K-bialgebra and hence B has at least the trivial quasitriangular structure. Are there any other structures? Note that $B *$ is a commutative K-algebra. For which R (if any) is $( B * , R )$ quasitriangular?

## References

1. Eilenberg, S. Automata, Languages, and Machines, Vol. A; Academic Press: New York, NY, USA, 1974. [Google Scholar]
2. Hopcroft, J.E.; Ullman, J.D. Introduction to Automata Theory, Languages, and Computation; Addison-Wesley: Upper Saddle River, NJ, USA, 1979. [Google Scholar]
3. Nichols, W.D.; Underwood, R.G. Algebraic Myhill-Nerode theorems. Theor. Comp. Sci. 2011, 412, 448–457. [Google Scholar] [CrossRef]
4. Sweedler, M. Hopf Algebras; W. A. Benjamin: New York, NY, USA, 1969. [Google Scholar]
5. Abe, E. Hopf Algebras. In Cambridge Tracts in Mathematics, 74; Cambridge University Press: Cambridge, UK; New York, NY, USA, 1980. [Google Scholar]
6. Childs, L.N. Taming Wild Extensions: Hopf Algebras and Local Galois Module Theory (Surveys and Monographs) 80; American Mathematical Society: Providence, RI, USA, 2000. [Google Scholar]
7. Montgomery, S. Hopf Algebras and Their Actions on Rings. CBMS 82; American Mathematical Society: Providence, RI, USA, 1993. [Google Scholar]
8. Underwood, R.G. An Introduction to Hopf Algebras; Springer: New York, NY, USA, 2011. [Google Scholar]
9. Nichita, F. Introduction to the yang-baxter equation with open problems. Axioms 2012, 1, 33–37. [Google Scholar] [CrossRef]
10. Drinfeld, V.G. On almost cocommutative Hopf algebras. Leningr. Math. J. 1990, 1, 321–342. [Google Scholar]