Subset Synchronization and Careful Synchronization of Binary Finite Automata

@article{Vorel2016SubsetSA,
  title={Subset Synchronization and Careful Synchronization of Binary Finite Automata},
  author={Vojtech Vorel},
  journal={Int. J. Found. Comput. Sci.},
  year={2016},
  volume={27},
  pages={557-578}
}
  • Vojtech Vorel
  • Published 16 March 2014
  • Computer Science, Mathematics
  • Int. J. Found. Comput. Sci.
We present a strongly exponential lower bound that applies both to the subset synchronization threshold for binary deterministic automata and to the careful synchronization threshold for binary partial automata. In the later form, the result finishes the research initiated by Martyugin (2013). Moreover, we show that both the thresholds remain strongly exponential even if restricted to strongly connected binary automata. In addition, we apply our methods to computational complexity. Existence of… 

Figures from this paper

Subset Synchronization in Monotonic Automata
TLDR
A complexity framework for dealing with problems for monotonic weakly acyclic automata over a three-letter alphabet is provided, and it is used to prove NP-completeness and inapproximability of problems such as {\sc Finite Automata Intersection} and the problem of computing the rank of a subset of states in this class.
Synchronization problems in automata without non-trivial cycles
  • A. Ryzhikov
  • Computer Science, Mathematics
    Theor. Comput. Sci.
  • 2019
Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata
TLDR
A full classification of the realizable complexities for constraint automata with at most two states and over a ternary alphabet is given and it is found that most constrained problems that are PSPACE-complete in general become NP-complete.
Synchronization Problems in Automata Without Non-trivial Cycles
TLDR
Upper and lower bounds on the length of a shortest word synchronizing a weakly acyclic automaton or, more generally, a subset of its states are provided and inapproximability of the problem of approximating this length is shown.
On Completely Reachable Automata and Subset Reachability
TLDR
This article provides families of synchronizing automata with subsets which cannot be reached with short words and shows that some subsets need exponentially long words to be reached, and proves an alternative version of Don's Conjecture about subset reachability.
Words of Minimum Rank in Deterministic Finite Automata
TLDR
Upper bounds on the length of shortest words of minimum rank in automata from the mentioned classes are proved, and several families of automata are provided with long words ofminimum rank.
Synchronizing Strongly Connected Partial DFAs
TLDR
It is concluded that solving fundamental synchronization problems is equally hard in both models, as an essential improvement of the results for one model implies an improvement for the other.
On Automata Recognizing Birecurrent Sets
  • A. Ryzhikov
  • Computer Science, Mathematics
    Theor. Comput. Sci.
  • 2019
N ov 2 01 7 On Automata Recognizing Birecurrent Sets
TLDR
It is proved that deciding whether a partial DFA recognizes a birecurrent set is a PSPACEcomplete problem, and it is shown that this problem is PSPACE-complete even in the case of binary partial DFAs with all states accepting and in the cases of binary complete DFAs.
Lower Bounds on Avoiding Thresholds
TLDR
A general construction of strongly connected DFAs with n states and the k-avoiding threshold in Θ(n) meets the known upper bound for k ≥ 3 and it is shown that 2n − 3 is attainable for every number of states n in the class of stronglyconnected synchronizing binary DFAs.
...
...

References

SHOWING 1-10 OF 39 REFERENCES
Careful Synchronization of Partial Automata with Restricted Alphabets
TLDR
A lower bound for the length of the shortest carefully synchronizing words of an automaton with a fixed number of states and afixed number of letters is obtained.
The Complexity of Finding Reset Words in Finite Automata
TLDR
It is established that the problem of deciding whether a shortest reset word has length k is complete for the complexity class DP, and it is observed that computing a reset word of a given length is FNP-complete.
Computational Complexity of Certain Problems Related to Carefully Synchronizing Words for Partial Automata and Directing Words for Nondeterministic Automata
  • Pavel Martyugin
  • Computer Science, Mathematics
    Theory of Computing Systems
  • 2013
We show that the problem of checking careful synchronizability of partial finite automata is PSPACE-complete. Also the problems of checking D1-, D2-, and D3-directability of nondeterministic finite
Compositions over a Finite Domain: From Completeness to Synchronizable Automata
  • A. Salomaa
  • Mathematics, Computer Science
    A Half-Century of Automata Theory
  • 2000
TLDR
This work considers functions whose domain is a fixed finite set N with n elements, n ≥ 2, and whose range is included in N, and considers two specific issues concerning functions of the kind mentioned: completeness and complexity of compositions.
On two Algorithmic Problems about Synchronizing Automata
TLDR
It is proved that two natural problems from the theory of synchronizing automata cannot be solved in polynomial time.
Modifying the upper bound on the length of minimal synchronizing word
TLDR
The upper bound on the length of the minimal synchronizing word is reduced to n(7n2 +6n - 16)/48, which is close to the best upper bound (n3 - n)/6 that was found almost 30 years ago.
Existence of constants in regular splicing languages
A lower bound for the length of the shortest carefully synchronizing words
TLDR
A lower bound for the careful synchronization threshold for automata with a given number of states is obtained by introducing the notion of careful synchronization for partial finite automata as a natural generalization of the synchronization notion for complete finite Automata.
On the Effects of Noise and Speed on Computations
...
...