Completely Reachable Almost Group Automata
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866929519662727168 |
|---|---|
| author | Torres, David Fernando Casas |
| author_facet | Torres, David Fernando Casas |
| contents | 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 | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_19172 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Completely Reachable Almost Group Automata Torres, David Fernando Casas Formal Languages and Automata Theory 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. |
| title | Completely Reachable Almost Group Automata |
| topic | Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2409.19172 |