Synchronizing automata of bounded rank
From MaRDI portal
Publication:2914705
Recommendations
Cites work
- scientific article; zbMATH DE number 3222112 (Why is no real title available?)
- A quadratic upper bound on the size of a synchronizing word in one-cluster automata
- Estimation of the length of reset words for automata with simple idempotents
- Lower Bounds for the Length of Reset Words in Eulerian Automata
- Lower bounds for the length of the shortest carefully synchronizing words for two- and three-letter partial automata
- Matrix Mortality and the Černý-Pin Conjecture
- Modifying the upper bound on the length of minimal synchronizing word
- On two Combinatorial Problems Arising from Automata Theory
- Pattern avoidance by palindromes
- Slowly synchronizing automata and digraphs
- Synchronizing Automata and the Černý Conjecture
- Synchronizing automata with a letter of deficiency 2
- Synchronizing finite automata on Eulerian digraphs.
- The Černý conjecture for aperiodic automata
Cited in
(18)- Synchronizing data words for register automata
- Computational complexity of synchronization under regular commutative constraints
- Computational complexity of synchronization under sparse regular constraints
- Ideal separation and general theorems for constrained synchronization and their application to small constraint automata
- Constrained synchronization and subset synchronization problems for weakly acyclic automata
- Attainable values of reset thresholds
- Constrained synchronization and commutativity
- Implementation and Application of Automata
- Semicomputable points in Euclidean spaces
- Semisimple synchronizing automata and the Wedderburn-Artin theory
- scientific article; zbMATH DE number 2040899 (Why is no real title available?)
- Synchronizing Automata with Extremal Properties
- scientific article; zbMATH DE number 7152087 (Why is no real title available?)
- A new lower bound for reset threshold of binary synchronizing automata with sink
- Synchronizing Automata Preserving a Chain of Partial Orders
- A tight linear bound on the synchronization delay of bijective automata
- Mortality and synchronization of unambiguous finite automata
- Deterministic synchronization of automata with bounded delay
This page was built for publication: Synchronizing automata of bounded rank
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914705)
