Synchronizing words and monoid factorization, yielding a new parameterized complexity class?

DOI10.1017/S0960129522000184MaRDI QIDQ5048011

Henning Fernau, Jens Bruchertseifer

Publication date: 17 November 2022

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

zbMATH Keywords

parameterized complexity; synchronizing word; deterministic finite automaton (DFA); monoid factorization

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q27: Parameterized complexity, tractability and kernelization