Author of the publication

Descriptional complexity of regular languages.

, , and . Handbook of Automata Theory (I.), European Mathematical Society Publishing House, Zürich, Switzerland, (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

Descriptional complexity of regular languages., , and . Handbook of Automata Theory (I.), European Mathematical Society Publishing House, Zürich, Switzerland, (2021)On 25 Years of CIAA Through the Lens of Data Science., , and . CIAA, volume 13266 of Lecture Notes in Computer Science, page 3-18. Springer, (2022)On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract)., , and . CIAA, volume 15015 of Lecture Notes in Computer Science, page 153-165. Springer, (2024)Enumerating regular expressions and their languages., , and . Handbook of Automata Theory (I.), European Mathematical Society Publishing House, Zürich, Switzerland, (2021)On Minimizing Regular Expressions Without Kleene Star., , and . FCT, volume 12867 of Lecture Notes in Computer Science, page 245-258. Springer, (2021)Optimal Regular Expressions for Palindromes of Given Length., and . MFCS, volume 202 of LIPIcs, page 52:1-52:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)The Pumping Lemma for Context-Free Languages is Undecidable., , and . DLT, volume 14791 of Lecture Notes in Computer Science, page 141-155. Springer, (2024)The Pumping Lemma for Regular Languages is Hard., , and . CIAA, volume 14151 of Lecture Notes in Computer Science, page 128-140. Springer, (2023)