Hermann Gruber

ORCID

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 8

Top Venues

CIAA

DLT

AFL

Int. J. Found. Comput. Sci.

Justus Liebig University Giessen (PHD)

Education History

Justus Liebig University Giessen

PHD

Publications

Hermann Gruber, Markus Holzer, Christian Rauch
The Pumping Lemma for Context-Free Languages is Undecidable. DLT (2024)
Hermann Gruber, Markus Holzer, Christian Rauch
The Pumping Lemma for Regular Languages is Hard. CIAA (2023)
Hermann Gruber, Markus Holzer, Christian Rauch
On 25 Years of CIAA Through the Lens of Data Science. CIAA (2022)
Hermann Gruber, Markus Holzer
Optimal Regular Expressions for Palindromes of Given Length. MFCS (2021)
Hermann Gruber, Markus Holzer, Simon Wolfsteiner
On Minimizing Regular Expressions Without Kleene Star. FCT (2021)
Hermann Gruber, Markus Holzer, Simon Wolfsteiner
On Minimizing Regular Expressions Without Kleene Star. Electron. Colloquium Comput. Complex. 27 (2020)
Hermann Gruber, Markus Holzer, Simon Wolfsteiner
On Minimal Grammar Problems for Finite Languages. DLT (2018)
Hermann Gruber, Markus Holzer, Sebastian Jakobi
More on deterministic and nondeterministic finite cover automata. Theor. Comput. Sci. 679 (2017)
Hermann Gruber, Markus Holzer
From Finite Automata to Regular Expressions and Back - A Summary on Descriptional Complexity. Int. J. Found. Comput. Sci. 26 (8) (2015)
Hermann Gruber, Markus Holzer, Sebastian Jakobi
More on Deterministic and Nondeterministic Finite Cover Automata - Extended Abstract. CIAA (2015)
Hermann Gruber, Markus Holzer
From Finite Automata to Regular Expressions and Back-A Summary on Descriptional Complexity. AFL (2014)
Hermann Gruber, Markus Holzer
Provably Shorter Regular Expressions from Finite Automata. Int. J. Found. Comput. Sci. 24 (8) (2013)
Hermann Gruber, Jonathan Lee, Jeffrey O. Shallit
Enumerating regular expressions and their languages CoRR (2012)
Hermann Gruber
Digraph Complexity Measures and Applications in Formal Language Theory. Discret. Math. Theor. Comput. Sci. 14 (2) (2012)
Hermann Gruber
Bounding the feedback vertex number of digraphs in terms of vertex degrees. Discret. Appl. Math. 159 (8) (2011)
Hermann Gruber
Digraph Complexity Measures and Applications in Formal Language Theory CoRR (2011)
Hermann Gruber
Bounding the Feedback Vertex Number of Digraphs in Terms of Vertex Degrees CoRR (2011)
Hermann Gruber, Stefan Gulan
Simplifying Regular Expressions. LATA (2010)
Hermann Gruber
On Balanced Separators, Treewidth, and Cycle Rank CoRR (2010)
Hermann Gruber, Markus Holzer, Martin Kutrib
On Measuring Non-recursive Trade-Offs. J. Autom. Lang. Comb. 15 (1/2) (2010)
Hermann Gruber, Markus Holzer
Tight Bounds on the Descriptional Complexity of Regular Expressions. Developments in Language Theory (2009)
Hermann Gruber, Markus Holzer, Martin Kutrib
More on the Size of Higman-Haines Sets: Effective Constructions. Fundam. Informaticae 91 (1) (2009)
Hermann Gruber, Markus Holzer, Martin Kutrib
On Measuring Non-Recursive Trade-Offs DCFS (2009)
Hermann Gruber, Markus Holzer
Language operations with regular expressions of polynomial size. Theor. Comput. Sci. 410 (35) (2009)
Hermann Gruber, Markus Holzer, Michael Tautschnig
Short Regular Expressions from Finite Automata: Empirical Results. CIAA (2009)
Hermann Gruber, Markus Holzer
Provably Shorter Regular Expressions from Deterministic Finite Automata. Developments in Language Theory (2008)
Hermann Gruber, Markus Holzer
Finite Automata, Digraph Connectivity, and Regular Expression Size. ICALP (2) (2008)
Hermann Gruber, Jan Johannsen
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity. FoSSaCS (2008)
Hermann Gruber, Markus Holzer
Language Operations with Regular Expressions of Polynomial Size. DCFS (2008)
Hermann Gruber, Markus Holzer
Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP. Developments in Language Theory (2007)
Hermann Gruber, Markus Holzer, Martin Kutrib
More on the Size of Higman-Haines Sets: Effective Constructions. MCU (2007)
Hermann Gruber, Markus Holzer
Computational Complexity of NFA Minimization for Finite and Unary Languages. LATA (2007)
Hermann Gruber, Markus Holzer, Martin Kutrib
The size of Higman-Haines sets. Theor. Comput. Sci. 387 (2) (2007)
Hermann Gruber, Markus Holzer
On the average state and transition complexity of finite languages. Theor. Comput. Sci. 387 (2) (2007)
Hermann Gruber, Markus Holzer, Oliver Ruepp
Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms. FUN (2007)
Hermann Gruber, Markus Holzer
Finding Lower Bounds for Nondeterministic State Complexity is Hard. Electron. Colloquium Comput. Complex. 13 (027) (2006)
Hermann Gruber, Markus Holzer
Finding Lower Bounds for Nondeterministic State Complexity Is Hard. Developments in Language Theory (2006)
Hermann Gruber, Markus Holzer
Results on the Average State and Transition Complexity of Finite Automata Accepting Finite Languages (Extended Abstract). DCFS (2006)
Hermann Gruber, Markus Holzer, Astrid Kiehn, Barbara König
On Timed Automata with Discrete Time - Structural and Language Theoretical Characterization. Developments in Language Theory (2005)

Hermann Gruber.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Hermann Gruber