Author of the publication

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.

 

Other publications of authors with the same name

From Decidability to Undecidability by Considering Regular Sets of Instances.. CoRR, (2019)Regular Intersection Emptiness of Graph Problems: Finding a Needle in a Haystack of Graphs with the Help of Automata., and . CoRR, (2020)Learning from Positive and Negative Examples: New Proof for Binary Alphabets., , and . CoRR, (2022)On the decidability of finding a positive ILP-instance in a regular set of ILP-instances.. Acta Informatica, 59 (4): 505-519 (2022)Properties of graphs specified by a regular language., , and . Acta Informatica, 59 (4): 357-385 (2022)From Decidability to Undecidability by Considering Regular Sets of Instances.. ICTCS, volume 2756 of CEUR Workshop Proceedings, page 33-46. CEUR-WS.org, (2020)Decomposing Permutation Automata., , and . CONCUR, volume 203 of LIPIcs, page 18:1-18:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)PACE Solver Description: Zygosity., , , , , and . IPEC, volume 285 of LIPIcs, page 39:1-39:3. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Entwicklung eines Domänenmodells zur Identifikation und Analyse von Prozessketten., , , and . FTVI/FTRI, volume P-197 of LNI, page 73-82. GI, (2012)Analyse und Design von Prozessketten., , and . FTVI/FTRI, volume P-162 of LNI, page 29-39. GI, (2010)