|
Mathematics
About the congruences of two-generated monoid
L. A. Kudryavtseva Moscow Institute of Electronic Technology, Chair of Higher Mathematics
Abstract:
The congruences of two-generated monoid which generated by pair of words of length 2 are considered over two-letter alphabet. It is shown that number of equivalence classes for words of length $n$ is equal to $n+1$. The number of words in each class is found.
Key words:
congruence, free semigroup, monoid, equivalence class.
Citation:
L. A. Kudryavtseva, “About the congruences of two-generated monoid”, Izv. Saratov Univ. Math. Mech. Inform., 10:1 (2010), 14–18
Linking options:
https://www.mathnet.ru/eng/isu3 https://www.mathnet.ru/eng/isu/v10/i1/p14
|
Statistics & downloads: |
Abstract page: | 230 | Full-text PDF : | 97 | References: | 42 | First page: | 1 |
|