Author of the publication

Analysis of an Efficient Reduction Algorithm for Random Regular Expressions Based on Universality Detection.

, and . CSR, volume 12730 of Lecture Notes in Computer Science, page 206-222. Springer, (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

Weakly-Unambiguous Parikh Automata and Their Link to Holonomic Series., , , and . ICALP, volume 168 of LIPIcs, page 114:1-114:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)One Drop of Non-Determinism in a Random Deterministic Automaton., , , and . STACS, volume 254 of LIPIcs, page 19:1-19:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations., , and . DLT, volume 12086 of Lecture Notes in Computer Science, page 164-177. Springer, (2020)Analysis of an Efficient Reduction Algorithm for Random Regular Expressions Based on Universality Detection., and . CSR, volume 12730 of Lecture Notes in Computer Science, page 206-222. Springer, (2021)A canonical tree decomposition for order types, and some applications., , , and . CoRR, (2024)Absorbing Patterns in BST-Like Expression-Trees., and . STACS, volume 187 of LIPIcs, page 48:1-48:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)New Analytic Techniques for Proving the Inherent Ambiguity of Context-Free Languages.. FSTTCS, volume 250 of LIPIcs, page 41:1-41:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)A Canonical Tree Decomposition for Chirotopes., , , and . SoCG, volume 293 of LIPIcs, page 23:1-23:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Systèmes de fonctions holonomes: application à la théorie des automates. (Systems of holonomic functions: application in automata theory).. Gustave Eiffel University, Champs-sur-Marne, France, (2021)Uniform Random Expressions Lack Expressivity., , and . MFCS, volume 138 of LIPIcs, page 51:1-51:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)