Subset Synchronization and Careful Synchronization of Binary Finite Automata

DOI10.1142/S0129054116500167zbMath1358.68178arXiv1403.3972MaRDI QIDQ2833542

Vojtěch Vorel

Publication date: 18 November 2016

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

synchronizing wordreset wordsynchronizing automaton, Černý conjecture

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

On automata recognizing birecurrent sets ⋮ Constrained synchronization and subset synchronization problems for weakly acyclic automata ⋮ Some results concerning careful synchronization of partial automata and subset synchronization of DFA's ⋮ Synchronizing times for \(k\)-sets in automata ⋮ Extremal Binary PFAs with Small Number of States ⋮ The road problem and homomorphisms of directed graphs ⋮ Lower Bounds for Synchronizing Word Lengths in Partial Automata ⋮ Synchronization problems in automata without non-trivial cycles

Cites Work

• Unnamed Item
• Exact synchronization for finite-state sources
• A lower bound for the length of the shortest carefully synchronizing words
• Improved upper bounds on synchronizing nondeterministic automata
• On the effects of noise and speed on computations

This page was built for publication: Subset Synchronization and Careful Synchronization of Binary Finite Automata