Lower Bounds for Synchronizing Word Lengths in Partial Automata
From MaRDI portal
Publication:5384430
DOI10.1142/S0129054119400021zbMath1415.68125arXiv1801.10436OpenAlexW2963246092MaRDI QIDQ5384430
Michiel de Bondt, Henk Don, Hans Zantema
Publication date: 24 June 2019
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.10436
Related Items (11)
Extremal binary PFAs in a Černý family ⋮ Using SAT solvers for synchronization issues in non-deterministic automata ⋮ Some results concerning careful synchronization of partial automata and subset synchronization of DFA's ⋮ Careful synchronization of partial deterministic finite automata ⋮ Synchronizing sequences for road colored digraphs ⋮ Extremal Binary PFAs with Small Number of States ⋮ D2-SYNCHRONIZATION IN NONDETERMINISTIC AUTOMATA ⋮ A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices ⋮ Slowly synchronizing automata with fixed alphabet size ⋮ Extremal synchronizing circular automata ⋮ Semicomputable points in Euclidean spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primitive digraphs with large exponents and slowly synchronizing automata
- A lower bound for the length of the shortest carefully synchronizing words
- An extremal problem for two families of sets
- DFAs and PFAs with long shortest synchronizing word length
- Experiments with Synchronizing Automata
- Subset Synchronization and Careful Synchronization of Binary Finite Automata
- Synchronization of Automata with One Undefined or Ambiguous Transition
- Primitive Sets of Nonnegative Matrices and Synchronizing Automata
- Synchronizing Automata and the Černý Conjecture
- On two Combinatorial Problems Arising from Automata Theory
- Asymptotic estimate of the length of a diagnostic word for a finite automaton
- Careful Synchronization of Partial Automata with Restricted Alphabets
- Attainable Values of Reset Thresholds
- An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture
This page was built for publication: Lower Bounds for Synchronizing Word Lengths in Partial Automata
