On finite monoids over nonnegative integer matrices and short killing words
From MaRDI portal
Publication:5090493
DOI10.4230/LIPIcs.STACS.2019.43OpenAlexW2921024523MaRDI QIDQ5090493
Stefan Kiefer, Corto N. Mascle
Publication date: 18 July 2022
Full work available at URL: https://dblp.uni-trier.de/db/journals/corr/corr1808.html#abs-1808-00940
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On incomplete and synchronizing finite sets
- A series of slowly synchronizing automata with a zero state over a small alphabet
- On NFAs where all states are final, initial, or both
- On synchronizing unambiguous automata
- Efficient algorithms for deciding the type of growth of products of integer matrices
- Mortality for 2 ×2 Matrices Is NP-Hard
- UNDECIDABILITY BOUNDS FOR INTEGER MATRICES USING CLAUS INSTANCES
- On the definition of a family of automata
- Synchronizing Automata and the Černý Conjecture
- A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
- Decidability of the Membership Problem for 2 × 2 integer matrices
- A Synergic Approach to the Minimal Uncompletable Words Problem
- On Non-complete Sets and Restivo’s Conjecture
- Unsolvability in 3 × 3 Matrices
- On finitely generated monoids of matrices with entries in $\mathbb {N}$
