On randomized generation of slowly synchronizing automata

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

Motivated by the randomized generation of slowly synchronizing automata, we study automata made of permutation letters and a merging letter of rank n- 1 . We present a constructive randomized procedure to generate minimal synchronizing automata of that kind with (potentially) large alphabet size based on recent results on primitive sets of matrices. We report numerical results showing that our algorithm finds automata with much larger reset threshold than a mere uniform random generation and we present new families of automata with reset threshold of Ω(n^2/4) . We finally report theoretical results on randomized generation of primitive sets of matrices: a set of permutation matrices with a 0 entry changed into a 1 is primitive and has exponent of O(n n) with high probability in case of uniform random distribution and the same holds for a random set of binary matrices where each entry is set, independently, equal to 1 with probability p and equal to 0 with probability 1-p , when np- n→∞ as n→∞ .

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 8

page 13

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...
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...
05/17/2018

The Synchronizing Probability Function for Primitive Sets of Matrices

Motivated by recent results relating synchronizing automata and primitiv...
11/03/2017

On Automata Recognizing Birecurrent Sets

In this note we study automata recognizing birecurrent sets. A set of wo...
12/22/2021

Properties of a Class of Toeplitz Words

We study the properties of the uncountable set of Stewart words. These a...
03/19/2016

Philosophical Solution to P=?NP: P is Equal to NP

The P=?NP problem is philosophically solved by showing P is equal to NP ...
07/04/2012

Planning in POMDPs Using Multiplicity Automata

Planning and learning in Partially Observable MDPs (POMDPs) are among th...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.