|
Completely reachable almost group automata
David Fernando Casas Torres Ural Federal University named after the First President of Russia B. N. Yeltsin
Abstract:
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.
Keywords:
Deterministic finite automata, Transition monoid, Complete reachability, Permutation group
Citation:
David Fernando Casas Torres, “Completely reachable almost group automata”, Ural Math. J., 10:2 (2024), 37–48
Linking options:
https://www.mathnet.ru/eng/umj232 https://www.mathnet.ru/eng/umj/v10/i2/p37
|
| Statistics & downloads: |
| Abstract page: | 95 | | Full-text PDF : | 46 | | References: | 30 |
|