Matrix Mortality and the Černý-Pin Conjecture
From MaRDI portal
Publication:3637214
DOI10.1007/978-3-642-02737-6_5zbMath1247.68123MaRDI QIDQ3637214
Benjamin Steinberg, Jorge Almeida
Publication date: 7 July 2009
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02737-6_5
Related Items
The Černý conjecture for one-cluster automata with prime length cycle, Primitive and irreducible automata, An algorithm for road coloring, A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number, Sync-maximal permutation groups equal primitive permutation groups, Character theory of monoids over an arbitrary field., Experiments with Synchronizing Automata, Synchronizing Automata of Bounded Rank, Quivers of monoids with basic algebras
Uses Software
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
- The quiver of an algebra associated to the Mantaci-Reutenauer descent algebra and the homology of regular semigroups.
- Synchronizing automata with a letter of deficiency 2
- The Burnside problem for semigroups
- On finite semigroups of matrices
- Sur le produit de concatenation non ambigu
- Un algorithme calculant le cardinal, fini ou infini, des demi-groupes de matrices
- Complex representations of finite monoids. II: Highest weight categories and quivers
- Reset words for commutative and solvable automata
- Synchronizing finite automata on Eulerian digraphs.
- Synchronizing generalized monotonic automata
- Rank of a finite automaton
- Synchronizing groups and automata
- Characters of finite semigroups
- In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton
- Yet Another Solution to the Burnside Problem for Matrix Semigroups
- Synchronizing Automata and the Černý Conjecture
- SOME RESULTS ON ČERNÝ TYPE PROBLEMS FOR TRANSFORMATION SEMIGROUPS
- Representation theory of finite semigroups, semigroup radicals and formal language theory
- On the irreducible representations of a finite semigroup
- On finite 0-simple semigroups and graph theory
- Unsolvability in 3 × 3 Matrices
- An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture
- Estimation of the length of reset words for automata with simple idempotents
