Synchronizing series-parallel deterministic finite automata with loops and related problems
Keyword(s):
We study the problem DFA-SW of determining if a given deterministic finite automaton A possesses a synchronizing word of length at most k for automata whose (multi-)graphs are TTSPL, i.e., series-parallel, plus allowing some self-loops. While DFA-SW remains NP-complete on TTSPL automata, we also find (further) restrictions with efficient (parameterized) algorithms. We also study the (parameterized) complexity of related problems, for instance, extension variants of the synchronizing word problem, or the problem of finding smallest alphabet-induced synchronizable sub-automata.
2017 ◽
Vol 28
(05)
◽
pp. 503-522
2020 ◽
Vol 31
(04)
◽
pp. 527-538
2005 ◽
Vol 16
(05)
◽
pp. 1027-1038
◽
2007 ◽
Vol 18
(06)
◽
pp. 1407-1416
◽
2019 ◽
Vol 30
(06n07)
◽
pp. 1117-1134
Keyword(s):
2008 ◽
Vol 19
(03)
◽
pp. 617-631
◽
2016 ◽
Vol 27
(02)
◽
pp. 161-185
2007 ◽
Vol Vol. 9 no. 2
◽
2017 ◽
Vol 28
(05)
◽
pp. 483-501
◽