An improvement to a recent upper bound for synchronizing words of finite automata
From MaRDI portal
Publication:5208377
DOI10.25596/jalc-2019-367zbMath1447.68007arXiv1901.06542MaRDI QIDQ5208377
Publication date: 15 January 2020
Full work available at URL: https://arxiv.org/abs/1901.06542
Related Items (21)
Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach ⋮ Extremal binary PFAs in a Černý family ⋮ Synchronizing words and monoid factorization, yielding a new parameterized complexity class? ⋮ Constrained synchronization for monotonic and solvable automata and automata with simple idempotents ⋮ Synchronizing times for \(k\)-sets in automata ⋮ Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees ⋮ Synchronizing words under \textsf{LTL} constraints ⋮ Extremal Binary PFAs with Small Number of States ⋮ Fast synchronization of inhomogenous random automata ⋮ Synchronizing deterministic push-down automata can be really hard ⋮ On the smallest synchronizing terms of finite tree automata ⋮ Preimage problems for deterministic finite automata ⋮ Circular automata synchronize with high probability ⋮ A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices ⋮ Unnamed Item ⋮ Semicomputable points in Euclidean spaces ⋮ Synchronizing words for real-time deterministic pushdown automata (extended abstract) ⋮ Sync-maximal permutation groups equal primitive permutation groups ⋮ The Synchronizing Probability Function for Primitive Sets of Matrices ⋮ Synchronizing series-parallel deterministic finite automata with loops and related problems ⋮ Reset complexity and completely reachable automata with simple idempotents
This page was built for publication: An improvement to a recent upper bound for synchronizing words of finite automata
