A Linear Bound on the k-rendezvous time for primitive sets of NZ matrices

DOI10.1007/978-3-030-24886-4_4zbMath1497.68248arXiv1903.10421OpenAlexW2965362737MaRDI QIDQ2327540

Raphaël M. Jungers, Ludovic Charlier, Umer Azfar, Costanza Catalano

Publication date: 15 October 2019

Full work available at URL: https://arxiv.org/abs/1903.10421

zbMATH Keywords

Černý conjecturesynchronizing automatonprimitive set of matrices

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Positive matrices and their generalizations; cones of matrices (15B48) Algebraic theory of languages and automata (68Q70) Algebraic systems of matrices (15A30)

Related Items (1)

A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices

This page was built for publication: A Linear Bound on the k-rendezvous time for primitive sets of NZ matrices