On 2-state Mealy automata of polynomial growth
We consider the sequence of 2-state Mealy automata over the finite alphabets, that have polynomial growth orders and define the infinitely presented automatic transformation semigroups.
Saved in:
| Date: | 2018 |
|---|---|
| Main Author: | Reznykov, I. I. |
| Format: | Article |
| Language: | English |
| Published: |
Lugansk National Taras Shevchenko University
2018
|
| Subjects: | |
| Online Access: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/973 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Algebra and Discrete Mathematics |
Institution
Algebra and Discrete MathematicsSimilar Items
-
Investigations of Mealy automata growth at iterations
by: Reznykov, Illya I.
Published: (2018) -
Investigations of Mealy automata growth at iterations
by: Reznykov, Illya I.
Published: (2018) -
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) -
Classification of inverse semigroups generated by two-state partially defined invertible automata over the two-symbol alphabet
by: Slupik, Janusz Konrad
Published: (2018)