Synchronizing series-parallel deterministic finite automata with loops and related problems-Reference-Cited by-同舟云学术

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

Published:2021 Issue: Volume:55 Page:7
ISSN:0988-3754
Container-title:RAIRO - Theoretical Informatics and Applications
language:
Short-container-title:RAIRO-Theor. Inf. Appl.

Author:

Bruchertseifer Jens^ORCID,Fernau Henning^ORCID

Abstract

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.

Publisher

EDP Sciences

Subject

Computer Science Applications,General Mathematics,Software

Link

https://www.rairo-ita.org/10.1051/ita/2021005/pdf

Reference55 articles.

1. A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA

2. Approximating the Minimum Length of Synchronizing Words Is Hard

3. Bläsius T., Friedrich T., Lischeid J., Meeks K. and Schirneck M., Efficiently enumerating hitting sets of hypergraphs arising in data profiling, in Algorithm Engineering and Experiments (ALENEX). SIAM (2019) 130–143.

4. The parameterized complexity of sequence alignment and consensus

5. Bruchertseifer J. and Fernau H., Synchronizing words and monoid factorization: a parameterized perspective, in Theory and Applications of Models of Computation, 16th International Conference, TAMC, edited by Chen J., Feng Q. and Xu J., eds., vol. 12337 of LNCS. Springer (2020) 352–364.