The Synchronizing Probability Function of an Automaton

DOI10.1137/100816109zbMath1248.68306OpenAlexW2053583025MaRDI QIDQ2902896

Raphaël M. Jungers

Publication date: 22 August 2012

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/100816109

zbMATH Keywords

linear programmingprobabilistic methodČerný's conjecturesynchronizing automataautonomous agents localization

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Formal languages and automata (68Q45) 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)

Related Items (9)

Synchronizing Automata on Quasi-Eulerian Digraph ⋮ P(l)aying for Synchronization ⋮ Synchronizing times for \(k\)-sets in automata ⋮ On primitivity of sets of matrices ⋮ Preimage problems for deterministic finite automata ⋮ SYNCHRONIZING QUASI-EULERIAN AND QUASI-ONE-CLUSTER AUTOMATA ⋮ On the Synchronizing Probability Function and the Triple Rendezvous Time ⋮ On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata ⋮ The Synchronizing Probability Function for Primitive Sets of Matrices

Uses Software

• CVX

This page was built for publication: The Synchronizing Probability Function of an Automaton