On the Synchronizing Probability Function and the Triple Rendezvous Time

DOI10.1007/978-3-319-15579-1_16zbMath1451.68148OpenAlexW234907752MaRDI QIDQ2799174

Raphaël M. Jungers, François Gonze

Publication date: 8 April 2016

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-15579-1_16

zbMATH Keywords

game theorysynchronizationČerný's conjecturesynchronizing probability functiontriple rendezvous time

Mathematics Subject Classification ID

Applications of game theory (91A80) Formal languages and automata (68Q45)

Related Items

A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices, On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata, The Synchronizing Probability Function for Primitive Sets of Matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On primitivity of sets of matrices
• An extremal problem for two families of sets
• Synchronizing finite automata on Eulerian digraphs.
• Synchronizing generalized monotonic automata
• Independent sets of words and the synchronization problem
• On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata
• The Synchronizing Probability Function of an Automaton
• A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA
• Modifying the Upper Bound on the Length of Minimal Synchronizing Word
• Reset Sequences for Monotonic Automata
• Synchronizing Automata and the Černý Conjecture
• On a Conjecture by Carpi and D’Alessandro
• The Averaging Trick and the Černý Conjecture
• Slowly Synchronizing Automata and Digraphs
• Genetic Algorithm for Synchronization
• On two Combinatorial Problems Arising from Automata Theory
• Convex Analysis
• An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture