Quasitriangular Structure of Myhill–Nerode Bialgebras
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 general...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2012-07-01
|
| Series: | Axioms |
| Subjects: | |
| Online Access: | http://www.mdpi.com/2075-1680/1/2/155 |