Classification of inverse semigroups generated by two-state partially defined invertible automata over the two-symbol alphabet
The classification of inverse semigroups generated by two-state partially defined invertible automata over a two-symbol alphabet is investigated. Two presentations of such semi-groups are given. The structures of these semigroups are analyzed.
Saved in:
| Date: | 2018 |
|---|---|
| Main Author: | Slupik, Janusz Konrad |
| Format: | Article |
| Language: | English |
| Published: |
Lugansk National Taras Shevchenko University
2018
|
| Subjects: | |
| Online Access: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/881 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Algebra and Discrete Mathematics |
Institution
Algebra and Discrete MathematicsSimilar Items
-
Free products of semigroups defined by automata
by: Kochubinska, Eugenia, et al.
Published: (2025) -
Free products of semigroups defined by automata
by: Kochubinska, Eugenia, et al.
Published: (2025) -
On sequences of Mealy automata and their limits
by: Reznykov, Illya I.
Published: (2018) -
On sequences of Mealy automata and their limits
by: Reznykov, Illya I.
Published: (2018) -
On 2-state Mealy automata of polynomial growth
by: Reznykov, I. I.
Published: (2018)