activity
20182024
most citedOn random primitive sets, directable NDFAs and the generation of slowly synchronizing DFAs

3 citations · 3 across the 6 of their papers we have counts for

collaborators
Showing cs.DMShow all

1 paper · 1 filter

cs.DM2019

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

Costanza Catalano, Umer Azfar, Ludovic Charlier +1

A set of nonnegative matrices is called primitive if there exists a product of these matrices that is entrywise positive. Motivated by recent results relating synchronizing automat…