On Timed Automata with Discrete Time - Structural and Language Theoretical Characterization. - Hermann Gruber; Markus Holzer 001; Astrid Kiehn; Barbara König 001 (Developments in Language Theory, 2005)

Results on the Average State and Transition Complexity of Finite Automata Accepting Finite Languages (Extended Abstract). - Hermann Gruber; Markus Holzer 001 (DCFS, 2006)

Finding Lower Bounds for Nondeterministic State Complexity is Hard. - Hermann Gruber; Markus Holzer 001 (Electron. Colloquium Comput. Complex., 2006)

Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP. - Hermann Gruber; Markus Holzer 001 (Developments in Language Theory, 2007)

Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms. - Hermann Gruber; Markus Holzer 001; Oliver Ruepp (FUN, 2007)

Computational Complexity of NFA Minimization for Finite and Unary Languages. - Hermann Gruber; Markus Holzer 001 (LATA, 2007)

On the average state and transition complexity of finite languages. - Hermann Gruber; Markus Holzer 001 (Theor. Comput. Sci., 2007)

The size of Higman-Haines sets. - Hermann Gruber; Markus Holzer 001; Martin Kutrib (Theor. Comput. Sci., 2007)

Provably Shorter Regular Expressions from Deterministic Finite Automata. - Hermann Gruber; Markus Holzer 001 (Developments in Language Theory, 2008)

Optimal Lower Bounds on Regular Expression Size Using Communication Complexity. - Hermann Gruber; Jan Johannsen (FoSSaCS, 2008)

Finite Automata, Digraph Connectivity, and Regular Expression Size. - Hermann Gruber; Markus Holzer 001 (ICALP (2), 2008)

Tight Bounds on the Descriptional Complexity of Regular Expressions. - Hermann Gruber; Markus Holzer 001 (Developments in Language Theory, 2009)

Short Regular Expressions from Finite Automata: Empirical Results. - Hermann Gruber; Markus Holzer 001; Michael Tautschnig (CIAA, 2009)

On Measuring Non-Recursive Trade-Offs - Hermann Gruber; Markus Holzer 001; Martin Kutrib (DCFS, 2009)

More on the Size of Higman-Haines Sets: Effective Constructions. - Hermann Gruber; Markus Holzer 001; Martin Kutrib (Fundam. Informaticae, 2009)

Language operations with regular expressions of polynomial size. - Hermann Gruber; Markus Holzer 001 (Theor. Comput. Sci., 2009)

Simplifying Regular Expressions. - Hermann Gruber; Stefan Gulan (LATA, 2010)

On Balanced Separators, Treewidth, and Cycle Rank - Hermann Gruber (CoRR, 2010)

On the descriptional and algorithmic complexity of regular languages. - Hermann Gruber (2010)

Bounding the feedback vertex number of digraphs in terms of vertex degrees. - Hermann Gruber (Discret. Appl. Math., 2011)

Enumerating regular expressions and their languages - Hermann Gruber; Jonathan Lee 005; Jeffrey O. Shallit (CoRR, 2012)

Digraph Complexity Measures and Applications in Formal Language Theory. - Hermann Gruber (Discret. Math. Theor. Comput. Sci., 2012)

Provably Shorter Regular Expressions from Finite Automata. - Hermann Gruber; Markus Holzer 001 (Int. J. Found. Comput. Sci., 2013)

More on Deterministic and Nondeterministic Finite Cover Automata - Extended Abstract. - Hermann Gruber; Markus Holzer 001; Sebastian Jakobi (CIAA, 2015)

From Finite Automata to Regular Expressions and Back - A Summary on Descriptional Complexity. - Hermann Gruber; Markus Holzer 001 (Int. J. Found. Comput. Sci., 2015)

More on deterministic and nondeterministic finite cover automata. - Hermann Gruber; Markus Holzer 001; Sebastian Jakobi (Theor. Comput. Sci., 2017)

On Minimal Grammar Problems for Finite Languages. - Hermann Gruber; Markus Holzer 001; Simon Wolfsteiner (DLT, 2018)

On Minimizing Regular Expressions Without Kleene Star. - Hermann Gruber; Markus Holzer 001; Simon Wolfsteiner (Electron. Colloquium Comput. Complex., 2020)

Descriptional complexity of regular languages. - Hermann Gruber; Markus Holzer 001; Martin Kutrib (Handbook of Automata Theory (I.), 2021)

Enumerating regular expressions and their languages. - Hermann Gruber; Jonathan Lee 005; Jeffrey O. Shallit (Handbook of Automata Theory (I.), 2021)

Optimal Regular Expressions for Palindromes of Given Length. - Hermann Gruber; Markus Holzer 001 (MFCS, 2021)

On 25 Years of CIAA Through the Lens of Data Science. - Hermann Gruber; Markus Holzer 001; Christian Rauch 001 (CIAA, 2022)

The Pumping Lemma for Regular Languages is Hard. - Hermann Gruber; Markus Holzer 001; Christian Rauch 001 (CIAA, 2023)

The Pumping Lemma for Context-Free Languages is Undecidable. - Hermann Gruber; Markus Holzer 001; Christian Rauch 001 (DLT, 2024)

On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract). - Hermann Gruber; Markus Holzer 001; Christian Rauch 001 (CIAA, 2024)

On Pumping Problems for Unary Regular Languages. - Hermann Gruber; Markus Holzer 001; Christian Rauch 001 (SOFSEM (2), 2025)