Abstract:We study synchronizing partial DFAs, which extend the classical concept of synchronizing complete DFAs and are a special case of synchronizing unambiguous NFAs. A partial DFA is called synchronizing if it has a word (called a \emph{reset word}) whose action brings a non-empty subset of states to a unique state and is undefined for all other states. The class of strongly connected partial DFAs is precisely the class of DFAs recognizing the Kleene star of prefix codes. While in the general case the problem of checking whether a partial DFA is synchronizing is PSPACE-complete, we show that in the strongly connected case, this problem can be efficiently reduced to the same problem for a complete DFA. Using combinatorial, algebraic, and formal languages methods, we develop techniques that relate main synchronization problems for strongly connected partial DFAs to the same problems for complete DFAs. In particular, this includes the Černý and the rank conjectures, the problem of finding a reset word, and upper bounds on the length of the shortest reset words of literal automata of finite prefix codes. We conclude 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.
| Comments: | Extended version of STACS 2021 paper |
| Subjects: | Formal Languages and Automata Theory (cs.FL); Combinatorics (math.CO) |
| Cite as: | arXiv:2101.05057 [cs.FL] |
| (or arXiv:2101.05057v3 [cs.FL] for this version) | |
| https://doi.org/10.48550/arXiv.2101.05057 arXiv-issued DOI via DataCite |
From: Marek Szykuła [view email]
[v1]
Wed, 13 Jan 2021 13:43:54 UTC (246 KB)
[v2]
Wed, 14 May 2025 12:30:18 UTC (40 KB)
[v3]
Tue, 26 May 2026 12:26:56 UTC (41 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。