A characterization of totally compatible automata

MaRDI QIDQ5871577zbMATH OpenFDO

Authors David Torres

Publication date 23 January 2023

Full work available at URL https://arxiv.org/abs/2110.05173, http://www.jalc.de/issues/2022/issue_27_4/jalc-2022-249-257.php

zbMATH Keywords

automatapatition set

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• A characterization of completely reachable automata
• Completeness of automaton mappings with respect to equivalence relations
• Completely reachable automata
• Structure and Transition-Preserving Functions of Finite Automata
• scientific article; zbMATH DE number 3882460

Cites work

• A characterization of completely reachable automata
• Completely reachable automata
• On the interplay between Černý and Babai's conjectures
• Orbits of primitive k-homogeneous groups on (n-k)-partitions with applications to semigroups
• Set-Transitive Permutation Groups

Cited in

(1)

• CHARACTERIZATION OF FINITE STATE AUTOMATA—TOPOLOGICAL APPROACH

This page was built for publication: A characterization of totally compatible automata

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