This article is
- freely available
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 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.
Keywords: algebra; coalgebra; bialgebra; Myhill–Nerode theorem; Myhill–Nerode bialgebra; quasitriangular structure
Article StatisticsClick here to load and display the download statistics.
Notes: Multiple requests from the same IP address are counted as one view.
Cite This Article
MDPI and ACS Style
Underwood, R.G. Quasitriangular Structure of Myhill–Nerode Bialgebras. Axioms 2012, 1, 155-172.
Underwood RG. Quasitriangular Structure of Myhill–Nerode Bialgebras. Axioms. 2012; 1(2):155-172.
Underwood, Robert G. 2012. "Quasitriangular Structure of Myhill–Nerode Bialgebras." Axioms 1, no. 2: 155-172.