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 generates a transitive imprimitive group.

Authors

Institutions

Publication Details

Journal
Ural mathematical journal
Published
2024-12-28
DOI
https://doi.org/10.15826/umj.2024.2.004
Primary Topic
semigroups and automata theory
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

COMPLETELY REACHABLE ALMOST GROUP AUTOMATA

David Casas
Ural mathematical journal
semigroups and automata theory
article

COMPLETELY REACHABLE ALMOST GROUP AUTOMATA

David Casas
article en

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.

Ural mathematical journalVol. 10(2)
Ural Federal University (RU)
Reduced inequalities
Openalex Percentile: Top 71%
semigroups and automata theory
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

COMPLETELY REACHABLE ALMOST GROUP AUTOMATA — David Casas · Ural mathematical journal (2024) | TGRS Research Map | TGRS