The synchronizing probability function of an automaton
From MaRDI portal
Publication:2902896
linear programmingprobabilistic methodsynchronizing automataautonomous agents localizationČerný's conjecture
Formal languages and automata (68Q45) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Stochastic network models in operations research (90B15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Recommendations
- On the synchronizing probability function and the triple rendezvous time. New approaches to Černý's conjecture
- On the synchronizing probability function and the triple rendezvous time for synchronizing automata
- The synchronizing probability function for primitive sets of matrices
- scientific article; zbMATH DE number 6861928
- The Cerny Conjecture Holds with High Probability
Cited in
(13)- The synchronizing probability function for primitive sets of matrices
- On the synchronizing probability function and the triple rendezvous time. New approaches to Černý's conjecture
- Preimage problems for deterministic finite automata
- On the synchronization of planar automata
- Generation of constants and synchronization of finite automata
- On primitivity of sets of matrices
- scientific article; zbMATH DE number 6861928 (Why is no real title available?)
- Synchronizing times for \(k\)-sets in automata
- The Synchronizing Probability Function for Primitive Sets of Matrices
- On the synchronizing probability function and the triple rendezvous time for synchronizing automata
- The synchronization game on subclasses of automata
- Synchronizing quasi-Eulerian and quasi-one-cluster automata
- Synchronizing automata on quasi-Eulerian digraph
This page was built for publication: The synchronizing probability function of an automaton
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2902896)
