Sync-maximal permutation groups equal primitive permutation groups

DOI10.1007/978-3-030-93489-7_4OpenAlexW4285545936MaRDI QIDQ2096582

Stefan Hoffmann

Publication date: 9 November 2022

Full work available at URL: https://arxiv.org/abs/2111.13527

zbMATH Keywords

primitive permutation groupssynchronizationfinite automataset of synchronizing wordssync-maximal groups

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (4)

Completely distinguishable automata and the set of synchronizing words ⋮ Binary and circular automata having maximal state complexity for the set of synchronizing words ⋮ New characterizations of primitive permutation groups with applications to synchronizing automata ⋮ Reset complexity and completely reachable automata with simple idempotents

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Černý conjecture and 1-contracting automata
• Primitive groups synchronize non-uniform maps of extreme ranks
• The Černý conjecture for one-cluster automata with prime length cycle
• Synchronizing automata preserving a chain of partial orders
• Primitive permutation groups and their section-regular partitions.
• An extremal problem for two families of sets
• Reset words for commutative and solvable automata
• A characterization of completely reachable automata
• Synchronizing generalized monotonic automata
• Primitive permutation groups and strongly factorizable transformation semigroups
• Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words
• State complexity of the set of synchronizing words for circular automata and automata over binary alphabets
• Constrained synchronization and commutativity
• Algebraic synchronization criterion and computing reset words
• Reset complexity of ideal languages over a binary alphabet
• Between primitive and 2-transitive: synchronization and its friends
• Synchronizing groups and automata
• Completely Reachable Automata
• Synchronization of Automata with One Undefined or Ambiguous Transition
• Reset Sequences for Monotonic Automata
• Synchronizing Automata and the Černý Conjecture
• Matrix Mortality and the Černý-Pin Conjecture
• On two Combinatorial Problems Arising from Automata Theory
• Les automates circulaires biaisés vérifient la conjecture de Černý
• Orbits of primitive $k$-homogenous groups on $(n-k)$-partitions with applications to semigroups
• Semicomputable points in Euclidean spaces
• Reset Complexity of Ideal Languages Over a Binary Alphabet
• An improvement to a recent upper bound for synchronizing words of finite automata
• Synchronizing Sequences for Probabilistic Automata
• Estimation of the length of reset words for automata with simple idempotents

This page was built for publication: Sync-maximal permutation groups equal primitive permutation groups