( en | de | ru )

 

Disambiguation of "Fernau, Henning"

Author of the publication

copydeleteadd this publication to your clipboard
On the Complexity of Intersection Non-emptiness for Star-Free Language Classes.

, , , , , , and . FSTTCS, volume 213 of LIPIcs, page 34:1-34:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Henning Fernau

Henning Fernau

Frank Fernau

Erik Fernau

Erik Fernau

 

Other publications of authors with the same name

Regulated Tree Automata., and . DCFS, volume 11612 of Lecture Notes in Computer Science, page 124-136. Springer, (2019)Synchronizing words and monoid factorization, yielding a new parameterized complexity class?, and . Math. Struct. Comput. Sci., 32 (2): 189-215 (2022)On the generative capacity of matrix insertion-deletion systems of small sum-norm., , and . Nat. Comput., 20 (4): 671-689 (2021)All Paths Lead to Rome., , , and . CoRR, (2022)Synchronization of Deterministic Visibly Push-Down Automata., and . FSTTCS, volume 182 of LIPIcs, page 45:1-45:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)On the Complexity of Intersection Non-emptiness for Star-Free Language Classes., , , , , , and . FSTTCS, volume 213 of LIPIcs, page 34:1-34:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)The Synchronization Game on Subclasses of Automata., , and . FUN, volume 226 of LIPIcs, page 14:1-14:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Winning Strategies for the Synchronization Game on Subclasses of Finite Automata., , , and . NCMA, volume 407 of EPTCS, page 77-85. (2024)Pattern Matching with Variables: Efficient Algorithms and Complexity Results., , , and . ACM Trans. Comput. Theory, 12 (1): 6:1-6:37 (2020)Optimal Bridge, Twin Bridges and Beyond: Inserting Edges into a Road Network to Minimize the Constrained Diameters., , and . AAIM (1), volume 15179 of Lecture Notes in Computer Science, page 94-108. Springer, (2024)