New characterizations of primitive permutation groups with applications to synchronizing automata
type: Item
instance of: scholarly article
title: New characterizations of primitive permutation groups with applications to synchronizing automata
author: Stefan Hoffmann
published in: Information and Computation
publication date: 2024-02-02T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7798813
zbMATH Keywords: primitive permutation groups
zbMATH Keywords: synchronization
zbMATH Keywords: finite automata
zbMATH Keywords: completely reachable automata
zbMATH Keywords: state complexity
zbMATH Keywords: set of synchronizing words
zbMATH Keywords: pairs of distinguishable subsets
MaRDI profile type: MaRDI publication profile
cites work: Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words
cites work: Sync-maximal permutation groups equal primitive permutation groups
cites work: Černý's conjecture and the road colouring problem
cites work: Estimation of the length of reset words for automata with simple idempotents
cites work: Between primitive and 2-transitive: synchronization and its friends
cites work: Primitive groups synchronize non-uniform maps of extreme ranks
cites work: Synchronizing groups and automata
cites work: Primitive permutation groups and strongly factorizable transformation semigroups
cites work: Q3862379
cites work: A remark about homogeneous experiments
cites work: Reset complexity of ideal languages over a binary alphabet
cites work: Constrained synchronization and commutativity
cites work: Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees
cites work: Q4231664
cites work: Intersection matrices for finite permutation groups
cites work: Q3659962
cites work: Transitivity of finite permutation groups on unordered sets
cites work: Theory of games and economic behavior.
cites work: Set-Transitive Permutation Groups
cites work: The classification of partition homogeneous groups with applications to semigroup theory
cites work: \(k\)-homogeneous groups
cites work: A Note on Two Set-Transitive Permutation Groups
cites work: 4-homogeneous groups
cites work: Automorphism groups of designs
cites work: A brief history of the classification of the finite simple groups
cites work: Primitivity, uniform minimality, and state complexity of Boolean operations
cites work: A note on homogeneous experiments with finite automata
cites work: Cerny's conjecture for automata with simple idempotents
cites work: Linear Automaton Transformations
cites work: State complexity of the set of synchronizing words for circular automata and automata over binary alphabets
cites work: Completely distinguishable automata and the set of synchronizing words
cites work: On primitivity of sets of matrices
cites work: The Synchronizing Probability Function for Primitive Sets of Matrices
cites work: Primitive sets of nonnegative matrices and synchronizing automata
cites work: Generalized primitivity of labeled digraphs
cites work: Equivalence of topological Markov shifts
cites work: The road coloring problem
cites work: A NOTE ON SYNCHRONIZED AUTOMATA AND ROAD COLORING PROBLEM
cites work: Sets of nonnegative matrices without positive products
cites work: A new proof of the Protasov-Voynov theorem on semigroups of nonnegative matrices
DOI: 10.1016/J.IC.2023.105086
Recommended article: Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words
Recommended article: Sync-maximal permutation groups equal primitive permutation groups
Recommended article: Primitive groups, graph endomorphisms and synchronization
Recommended article: Synchronizing groups and automata
Recommended article: Between primitive and 2-transitive: synchronization and its friends
description: scientific article; zbMATH DE number 7798813