A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number

DOI10.1007/s10801-018-0851-1zbMath1494.68147arXiv1711.00651OpenAlexW2898531758WikidataQ129047924 ScholiaQ129047924MaRDI QIDQ2011387

Emanuele Rodaro

Publication date: 6 December 2019

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

packing numberČerný's conjectureWedderburn-Artin theoremsynchronizing automatonsimple automatonsemisimple automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Primitive digraphs with large exponents and slowly synchronizing automata
• The Černý conjecture for one-cluster automata with prime length cycle
• Primitive and irreducible automata
• Synchronizing automata preserving a chain of partial orders
• Reset words for commutative and solvable automata
• Synchronizing finite automata on Eulerian digraphs.
• Synchronizing generalized monotonic automata
• Algebraic synchronization criterion and computing reset words
• Synchronizing groups and automata
• A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA
• Synchronizing Automata and the Černý Conjecture
• Representation theory of finite semigroups, semigroup radicals and formal language theory
• Matrix Mortality and the Černý-Pin Conjecture
• On two Combinatorial Problems Arising from Automata Theory
• Semisimple Synchronizing Automata and the Wedderburn-Artin Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item