Synchronizing automata of bounded rank
From MaRDI portal
Publication:2914705
DOI10.1007/978-3-642-31606-7_15zbMATH Open1297.68133OpenAlexW71470512MaRDI QIDQ2914705FDOQ2914705
Authors: Vladimir V. Gusev 
Publication date: 20 September 2012
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-31606-7_15
Recommendations
Cites Work
- Synchronizing Automata and the Černý Conjecture
- Synchronizing finite automata on Eulerian digraphs.
- A quadratic upper bound on the size of a synchronizing word in one-cluster automata
- On two Combinatorial Problems Arising from Automata Theory
- The Černý conjecture for aperiodic automata
- Title not available (Why is that?)
- Pattern avoidance by palindromes
- Modifying the upper bound on the length of minimal synchronizing word
- Lower Bounds for the Length of Reset Words in Eulerian Automata
- Slowly synchronizing automata and digraphs
- Synchronizing automata with a letter of deficiency 2
- Matrix Mortality and the Černý-Pin Conjecture
- Estimation of the length of reset words for automata with simple idempotents
- Lower bounds for the length of the shortest carefully synchronizing words for two- and three-letter partial automata
Cited In (19)
- Constrained synchronization and commutativity
- Title not available (Why is that?)
- Synchronization problems in automata without non-trivial cycles
- Constrained synchronization and subset synchronization problems for weakly acyclic automata
- Title not available (Why is that?)
- Mortality and synchronization of unambiguous finite automata
- Semisimple synchronizing automata and the Wedderburn-Artin theory
- Computational complexity of synchronization under regular commutative constraints
- Computational complexity of synchronization under sparse regular constraints
- Attainable values of reset thresholds
- Synchronizing Automata Preserving a Chain of Partial Orders
- Synchronizing data words for register automata
- Synchronizing Automata with Extremal Properties
- Deterministic synchronization of automata with bounded delay
- A new lower bound for reset threshold of binary synchronizing automata with sink
- Ideal separation and general theorems for constrained synchronization and their application to small constraint automata
- Semicomputable points in Euclidean spaces
- Implementation and Application of Automata
- A tight linear bound on the synchronization delay of bijective automata
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)
