Synchronizing series-parallel deterministic finite automata with loops and related problems

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 fi...

Full description

Saved in:
Bibliographic Details
Published inRAIRO. Informatique théorique et applications Vol. 55; p. 7
Main Authors Bruchertseifer, Jens, Fernau, Henning
Format Journal Article
LanguageEnglish
Published Paris EDP Sciences 2021
Subjects
Algorithms
Graphs
Parameterization
Series (mathematics)
Synchronism
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0988-3754
1290-385X
DOI:10.1051/ita/2021005