Hermann Gruber

Available identifiers

zbMath Open gruber.hermannMaRDI QIDQ534358

List of research outcomes

Publication	Date of Publication	Type
The pumping lemma for regular languages is hard	2024-02-28	Paper
https://portal.mardi4nfdi.de/entity/Q6168470	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
https://portal.mardi4nfdi.de/entity/Q4994933	2021-06-22	Paper
https://portal.mardi4nfdi.de/entity/Q5146524	2021-01-26	Paper
On minimal grammar problems for finite languages	2018-11-22	Paper
More on deterministic and nondeterministic finite cover automata	2017-06-19	Paper
On Measuring Non-Recursive Trade-Offs	2016-09-29	Paper
From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity	2016-04-15	Paper
More on Deterministic and Nondeterministic Finite Cover Automata	2015-09-23	Paper
PROVABLY SHORTER REGULAR EXPRESSIONS FROM FINITE AUTOMATA	2014-07-04	Paper
https://portal.mardi4nfdi.de/entity/Q5403035	2014-03-25	Paper
On balanced separators, treewidth, and cycle rank	2013-06-25	Paper
Enumerating regular expressions and their languages	2012-04-23	Paper
Bounding the feedback vertex number of digraphs in terms of vertex degrees	2011-05-17	Paper
Simplifying Regular Expressions	2010-05-26	Paper
Language operations with regular expressions of polynomial size	2009-08-07	Paper
Short Regular Expressions from Finite Automata: Empirical Results	2009-07-09	Paper
Tight Bounds on the Descriptional Complexity of Regular Expressions	2009-07-07	Paper
On knot polynomials of annular surfaces and their boundary links	2009-06-30	Paper
More on the Size of Higman-Haines Sets: Effective Constructions	2009-06-23	Paper
Finding Lower Bounds for Nondeterministic State Complexity Is Hard	2009-03-26	Paper
More on the Size of Higman-Haines Sets: Effective Constructions	2009-03-05	Paper
Provably Shorter Regular Expressions from Deterministic Finite Automata	2008-10-30	Paper
Finite Automata, Digraph Connectivity, and Regular Expression Size	2008-08-19	Paper
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity	2008-04-11	Paper
On the average state and transition complexity of finite languages	2007-12-19	Paper
The size of Higman-Haines sets	2007-12-19	Paper
Inapproximability of Nondeterministic State and Transition Complexity Assuming P ≠ NP	2007-11-28	Paper
Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms	2007-11-15	Paper
Developments in Language Theory	2006-06-23	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Hermann Gruber