The Synchronizing Probability Function for Primitive Sets of Matrices

05/17/2018
by   Costanza Catalano, et al.
0

Motivated by recent results relating synchronizing automata and primitive sets, we tackle the synchronization process and the related longstanding Černý conjecture by studying the primitivity phenomenon for sets of nonnegative matrices having neither zero-rows nor zero-columns. We formulate the primitivity process in the setting of a two-player probabilistic game and we make use of convex optimization techniques to describe its behavior. We report numerical results and supported by them we state a conjecture that, if true, would imply an upper bound of n(n-1) on the reset threshold of a certain (broad) class of automata.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/25/2019

A linear bound on the k-rendezvous time for primitive sets of NZ matrices

A set of nonnegative matrices is called primitive if there exists a prod...
research
05/17/2018

On randomized generation of slowly synchronizing automata

Motivated by the randomized generation of slowly synchronizing automata,...
research
01/22/2019

Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete

Checking whether two pushdown automata with restricted silent actions ar...
research
05/26/2022

The boundedness and zero isolation problems for weighted automata over nonnegative rationals

We consider linear cost-register automata (equivalent to weighted automa...
research
10/24/2018

On random primitive sets, directable NDFAs and the generation of slowly synchronizing DFAs

We tackle the problem of the randomized generation of slowly synchronizi...
research
12/04/2017

An Upper Bound on the GKS Game via Max Bipartite Matching

The sensitivity conjecture is a longstanding conjecture concerning the r...
research
08/28/2023

Infomathic

Since its existence, the computer tool has often supported mathematician...

Please sign up or login with your details

Forgot password? Click here to reset