Sync-maximal permutation groups equal primitive permutation groups
From MaRDI portal
Publication:2096582
Recommendations
- Some Primitive Permutation Groups
- The primitive permutation groups of certain degrees
- Finite groups in which maximal subgroups of Sylow \(p\)-subgroups are nearly \(S\)-permutable
- Primitive groups synchronize non-uniform maps of extreme ranks
- Multiplicity-free and self-paired primitive permutation groups
- Groups with maximal subgroups of Sylow subgroups -permutably embedded
- X-permutable maximal subgroups of Sylow subgroups of finite groups
- Finite groups with \(X\)-permutable maximal subgroups of Sylow subgroups.
- Synchronising primitive groups of diagonal type exist
- Permutation-like matrix groups with a maximal cycle of prime square length
Cites work
- A characterization of completely reachable automata
- An extremal problem for two families of sets
- An improvement to a recent upper bound for synchronizing words of finite automata
- Between primitive and 2-transitive: synchronization and its friends
- Completely reachable automata
- Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words
- Complexity of problems concerning reset words for some partial cases of automata
- Constrained synchronization and commutativity
- Estimation of the length of reset words for automata with simple idempotents
- Extensions to minimal synchronizing words
- scientific article; zbMATH DE number 7228447 (Why is no real title available?)
- scientific article; zbMATH DE number 3864504 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3568582 (Why is no real title available?)
- scientific article; zbMATH DE number 3605922 (Why is no real title available?)
- scientific article; zbMATH DE number 1261512 (Why is no real title available?)
- scientific article; zbMATH DE number 2040899 (Why is no real title available?)
- scientific article; zbMATH DE number 1834666 (Why is no real title available?)
- scientific article; zbMATH DE number 897906 (Why is no real title available?)
- scientific article; zbMATH DE number 3222112 (Why is no real title available?)
- scientific article; zbMATH DE number 3266647 (Why is no real title available?)
- scientific article; zbMATH DE number 3328721 (Why is no real title available?)
- scientific article; zbMATH DE number 3354928 (Why is no real title available?)
- Les automates circulaires biaisés vérifient la conjecture de Černý
- Matrix Mortality and the Černý-Pin Conjecture
- On two Combinatorial Problems Arising from Automata Theory
- Orbits of primitive k-homogeneous groups on (n-k)-partitions with applications to semigroups
- Primitive groups synchronize non-uniform maps of extreme ranks
- Primitive permutation groups and strongly factorizable transformation semigroups
- Primitive permutation groups and their section-regular partitions.
- Reset complexity of ideal languages over a binary alphabet
- Reset complexity of ideal languages over a binary alphabet
- Reset Sequences for Monotonic Automata
- Reset words for commutative and solvable automata
- Semicomputable points in Euclidean spaces
- State complexity of the set of synchronizing words for circular automata and automata over binary alphabets
- Synchronization of automata with one undefined or ambiguous transition
- Synchronizing Automata and the Černý Conjecture
- Synchronizing automata preserving a chain of partial orders
- Synchronizing generalized monotonic automata
- Synchronizing groups and automata
- Synchronizing Sequences for Probabilistic Automata
- The Černý conjecture and 1-contracting automata
- The Černý conjecture for aperiodic automata
- The Černý conjecture for one-cluster automata with prime length cycle
Cited in
(6)- Reset complexity and completely reachable automata with simple idempotents
- Primitive groups synchronize non-uniform maps of extreme ranks
- 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
- Completely distinguishable automata and the set of synchronizing words
This page was built for publication: Sync-maximal permutation groups equal primitive permutation groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096582)
