Synchronizing times for \(k\)-sets in automata

DOI10.37236/9819OpenAlexW3080853710MaRDI QIDQ2170794

Yanyan Li

Publication date: 6 September 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Unnamed Item
• An extremal problem for two families of sets
• Synchronizing finite automata on Eulerian digraphs.
• Černý's conjecture and the road colouring problem
• On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata
• Subset Synchronization and Careful Synchronization of Binary Finite Automata
• The Synchronizing Probability Function of an Automaton
• Reset Sequences for Monotonic Automata
• Synchronizing Automata and the Černý Conjecture
• On two Combinatorial Problems Arising from Automata Theory
• An improvement to a recent upper bound for synchronizing words of finite automata

This page was built for publication: Synchronizing times for \(k\)-sets in automata