Completely reachable almost group automata

DOI10.15826/UMJ.2024.2.004MaRDI QIDQ6970990zbMATH OpenFDO

Authors David Torres

Publication date 17 June 2025

Published in Ural Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15826/UMJ.2024.2.004

zbMATH Keywords

complete reachabilitydeterministic finite automatapermutation grouptransition monoid

Mathematics Subject Classification ID

Symmetric groups (20B30) Semigroups in automata theory, linguistics, etc. (20M35) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Cites work

• A characterization of completely reachable automata
• A new lower bound for reset threshold of binary synchronizing automata with sink
• Binary completely reachable automata
• Completely reachable automata
• Completely reachable automata: a polynomial algorithm and quadratic upper bounds
• Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees
• Estimation of the length of reset words for automata with simple idempotents
• Near permutation semigroups.
• New characterizations of primitive permutation groups with applications to synchronizing automata
• Reset complexity of ideal languages over a binary alphabet
• Synchronizing almost-group automata
• The Černý conjecture and 1-contracting automata

This page was built for publication: Completely reachable almost group automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6970990)