Fast synchronization of inhomogenous random automata

Gerencsér, Balázs and Várkonyi, Zsombor (2024) Fast synchronization of inhomogenous random automata. INFORMATION AND COMPUTATION, 296. ISSN 0890-5401

Preview

Text 1-s2.0-S0890540123001323-main.pdf - Published Version Available under License Creative Commons Attribution. Download (214kB) | Preview

Abstract

We examine the reset threshold of randomly generated deterministic automata. We present a simple proof that an automaton with a random mapping and two random permutation letters has a reset threshold of O(√ n log 3 n) with high probability, assuming only certain partial independence of the letters. Our observation is motivated by Nicaud (2019) providing a near-linear bound in the case of two random mapping letters, among multiple other results. The upper bound for the latter case has been recently improved by the breakthrough work of Chapuy and Perarnau (2023) to O(√n log n).

Actions (login required)

Edit Item