Jens Bruchertseifer
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jens Bruchertseifer has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Ali C. Demiralp
RWTH Aachen University
1 shared publication - Benjamin Weyers
Trier University, Trier, Germany
1 shared publication - Henning Fernau
Universität Trier
1 shared publication - Marcel Krüger
RWTH Aachen University
1 shared publication - Sebastian Spreizer
University of Freiburg
1 shared publication - Simon Oehrl
RWTH Aachen University
1 shared publication
Latest Publications
- 1 January 2022
- Published by Springer Nature
- p. 295-305
Insite: A Pipeline Enabling In-Transit Visualization and Analysis for Neuronal Network Simulations
- 1 January 2022
- Published by Springer Nature
- p. 295-305
Insite: A Pipeline Enabling In-Transit Visualization and Analysis for Neuronal Network Simulations
- Open Access
- 22 July 2021
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 55, 7
Synchronizing series-parallel deterministic finite automata with loops and related problems
We study the problem DFA-SW of determining if a given deterministic finite automatonApossesses a synchronizing word of length at mostkfor 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.
- 22 July 2021
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 55, 7
Open AccessSynchronizing series-parallel deterministic finite automata with loops and related problems
We study the problem DFA-SW of determining if a given deterministic finite automatonApossesses a synchronizing word of length at mostkfor 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.