( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Complexity of Intersection Non-emptiness for Star-Free Language Classes.

, , , , , , и . FSTTCS, том 213 из LIPIcs, стр. 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.

Henning Fernau

Henning Fernau

Erik Fernau

Frank Fernau

Erik Fernau

 

Другие публикации лиц с тем же именем

Synchronizing words and monoid factorization, yielding a new parameterized complexity class?, и . Math. Struct. Comput. Sci., 32 (2): 189-215 (2022)All Paths Lead to Rome., , , и . CoRR, (2022)Regulated Tree Automata., и . DCFS, том 11612 из Lecture Notes in Computer Science, стр. 124-136. Springer, (2019)On the generative capacity of matrix insertion-deletion systems of small sum-norm., , и . Nat. Comput., 20 (4): 671-689 (2021)The Synchronization Game on Subclasses of Automata., , и . FUN, том 226 из LIPIcs, стр. 14:1-14:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Synchronization of Deterministic Visibly Push-Down Automata., и . FSTTCS, том 182 из LIPIcs, стр. 45:1-45:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)On the Complexity of Intersection Non-emptiness for Star-Free Language Classes., , , , , , и . FSTTCS, том 213 из LIPIcs, стр. 34:1-34:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Pattern Matching with Variables: Efficient Algorithms and Complexity Results., , , и . 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., , и . AAIM (1), том 15179 из Lecture Notes in Computer Science, стр. 94-108. Springer, (2024)On Computational Completeness of Semi-Conditional Matrix Grammars., , и . CoRR, (2024)