COMPLETELY REACHABLE ALMOST GROUP AUTOMATA
We consider finite deterministic automata such that their alphabets consist of exactly one letter of defect 1 and a set of permutations of the state set. We study under which conditions such an automaton is completely reachable. We focus our attention on the case when the set of permutations generat...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Ural Branch of the Russian Academy of Sciences and Ural Federal University named after the first President of Russia B.N.Yeltsin, Krasovskii Institute of Mathematics and Mechanics
2024-12-01
|
| Series: | Ural Mathematical Journal |
| Subjects: | |
| Online Access: | https://umjuran.ru/index.php/umj/article/view/859 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849398185984786432 |
|---|---|
| author | David Fernando Casas Torres |
| author_facet | David Fernando Casas Torres |
| author_sort | David Fernando Casas Torres |
| collection | DOAJ |
| description | We consider finite deterministic automata such that their alphabets consist of exactly one letter of defect 1 and a set of permutations of the state set. We study under which conditions such an automaton is completely reachable. We focus our attention on the case when the set of permutations generates a transitive imprimitive group. |
| format | Article |
| id | doaj-art-b39d4b77cc2d4a8a8f99fc9737d5e790 |
| institution | Kabale University |
| issn | 2414-3952 |
| language | English |
| publishDate | 2024-12-01 |
| publisher | Ural Branch of the Russian Academy of Sciences and Ural Federal University named after the first President of Russia B.N.Yeltsin, Krasovskii Institute of Mathematics and Mechanics |
| record_format | Article |
| series | Ural Mathematical Journal |
| spelling | doaj-art-b39d4b77cc2d4a8a8f99fc9737d5e7902025-08-20T03:38:40ZengUral Branch of the Russian Academy of Sciences and Ural Federal University named after the first President of Russia B.N.Yeltsin, Krasovskii Institute of Mathematics and MechanicsUral Mathematical Journal2414-39522024-12-0110210.15826/umj.2024.2.004215COMPLETELY REACHABLE ALMOST GROUP AUTOMATADavid Fernando Casas Torres0Ural Federal University, 51 Lenina Str., Ekaterimburg, 620000We consider finite deterministic automata such that their alphabets consist of exactly one letter of defect 1 and a set of permutations of the state set. We study under which conditions such an automaton is completely reachable. We focus our attention on the case when the set of permutations generates a transitive imprimitive group.https://umjuran.ru/index.php/umj/article/view/859deterministic finite automata, transition monoid, complete reachability, permutation group |
| spellingShingle | David Fernando Casas Torres COMPLETELY REACHABLE ALMOST GROUP AUTOMATA Ural Mathematical Journal deterministic finite automata, transition monoid, complete reachability, permutation group |
| title | COMPLETELY REACHABLE ALMOST GROUP AUTOMATA |
| title_full | COMPLETELY REACHABLE ALMOST GROUP AUTOMATA |
| title_fullStr | COMPLETELY REACHABLE ALMOST GROUP AUTOMATA |
| title_full_unstemmed | COMPLETELY REACHABLE ALMOST GROUP AUTOMATA |
| title_short | COMPLETELY REACHABLE ALMOST GROUP AUTOMATA |
| title_sort | completely reachable almost group automata |
| topic | deterministic finite automata, transition monoid, complete reachability, permutation group |
| url | https://umjuran.ru/index.php/umj/article/view/859 |
| work_keys_str_mv | AT davidfernandocasastorres completelyreachablealmostgroupautomata |