Completely reachable automata: a polynomial algorithm and quadratic upper bounds

DOI10.4230/lipics.icalp.2023.59MaRDI QIDQ6638061

Robert Ferens, Marek Szykuła

Publication date: 14 November 2024

zbMATH Keywords

DFAreachabilitysynchronizing wordreset wordČerný conjecturesynchronizing automatoncomplete reachabilityextending wordreset thresholdsimple idempotent

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (1)

Reset thresholds of transformation monoids

This page was built for publication: Completely reachable automata: a polynomial algorithm and quadratic upper bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6638061)