Quasitriangular Structure of Myhill–Nerode Bialgebras
AbstractIn 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.
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
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.Chicago/Turabian Style
Underwood, Robert G. 2012. "Quasitriangular Structure of Myhill–Nerode Bialgebras." Axioms 1, no. 2: 155-172.