| Publication | Date of Publication | Type |
|---|
| On pumping preserving homomorphisms and the complexity of the pumping problem (extended abstract) | 2025-01-20 | Paper |
The pumping lemma for regular languages is hard
Implementation and Application of Automata | 2024-02-28 | Paper |
| Optimal Regular Expressions for Palindromes of Given Length | 2023-08-08 | Paper |
| On 25 years of CIAA through the lens of data science | 2022-08-16 | Paper |
| On minimizing regular expressions without Kleene star | 2022-05-20 | Paper |
| Descriptional complexity of regular languages | 2022-02-04 | Paper |
| From finite automata to regular expressions and back -- a summary on descriptional complexity | 2021-06-22 | Paper |
| scientific article; zbMATH DE number 7301306 (Why is no real title available?) | 2021-01-26 | Paper |
| On minimal grammar problems for finite languages | 2018-11-22 | Paper |
More on deterministic and nondeterministic finite cover automata
Theoretical Computer Science | 2017-06-19 | Paper |
On measuring non-recursive trade-offs
Journal of Automata, Languages and Combinatorics | 2016-09-29 | Paper |
From finite automata to regular expressions and back -- a summary on descriptional complexity
International Journal of Foundations of Computer Science | 2016-04-15 | Paper |
More on deterministic and nondeterministic finite cover automata (extended abstract)
Implementation and Application of Automata | 2015-09-23 | Paper |
Provably shorter regular expressions from finite automata
International Journal of Foundations of Computer Science | 2014-07-04 | Paper |
Digraph complexity measures and applications in formal language theory
(available as arXiv preprint) | 2014-03-25 | Paper |
| Digraph complexity measures and applications in formal language theory | 2014-03-25 | Paper |
On balanced separators, treewidth, and cycle rank
Journal of Combinatorics | 2013-06-25 | Paper |
Enumerating regular expressions and their languages
(available as arXiv preprint) | 2012-04-23 | Paper |
Bounding the feedback vertex number of digraphs in terms of vertex degrees
Discrete Applied Mathematics | 2011-05-17 | Paper |
Simplifying regular expressions. A quantitative perspective
Language and Automata Theory and Applications | 2010-05-26 | Paper |
Language operations with regular expressions of polynomial size
Theoretical Computer Science | 2009-08-07 | Paper |
Short Regular Expressions from Finite Automata: Empirical Results
Implementation and Application of Automata | 2009-07-09 | Paper |
Tight Bounds on the Descriptional Complexity of Regular Expressions
Developments in Language Theory | 2009-07-07 | Paper |
On knot polynomials of annular surfaces and their boundary links
Mathematical Proceedings of the Cambridge Philosophical Society | 2009-06-30 | Paper |
More on the Size of Higman-Haines Sets: Effective Constructions
Fundamenta Informaticae | 2009-06-23 | Paper |
Finding Lower Bounds for Nondeterministic State Complexity Is Hard
Developments in Language Theory | 2009-03-26 | Paper |
More on the Size of Higman-Haines Sets: Effective Constructions
Lecture Notes in Computer Science | 2009-03-05 | Paper |
Provably Shorter Regular Expressions from Deterministic Finite Automata
Developments in Language Theory | 2008-10-30 | Paper |
Finite Automata, Digraph Connectivity, and Regular Expression Size
Automata, Languages and Programming | 2008-08-19 | Paper |
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
Foundations of Software Science and Computational Structures | 2008-04-11 | Paper |
The size of Higman-Haines sets
Theoretical Computer Science | 2007-12-19 | Paper |
On the average state and transition complexity of finite languages
Theoretical Computer Science | 2007-12-19 | Paper |
Inapproximability of Nondeterministic State and Transition Complexity Assuming P ≠ NP
Developments in Language Theory | 2007-11-28 | Paper |
Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms
Lecture Notes in Computer Science | 2007-11-15 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2006-06-23 | Paper |
| Estimates for the minimal crossing number | 2003-03-21 | Paper |
