 | 2012 |
|---|
| 26 |       | Hermann Gruber,
Jonathan Lee,
Jeffrey Shallit:
Enumerating regular expressions and their languages
CoRR abs/1204.4982: (2012) |
| 2011 |
|---|
| 25 | | Hermann Gruber:
Bounding the Feedback Vertex Number of Digraphs in Terms of Vertex Degrees
CoRR abs/1101.1291: (2011) |
| 24 | | Hermann Gruber:
Digraph Complexity Measures and Applications in Formal Language Theory
CoRR abs/1111.5357: (2011) |
| 23 | | Hermann Gruber:
Bounding the feedback vertex number of digraphs in terms of vertex degrees.
Discrete Applied Mathematics 159(8): 872-875 (2011) |
| 2010 |
|---|
| 22 | | Hermann Gruber,
Stefan Gulan:
Simplifying Regular Expressions.
LATA 2010: 285-296 |
| 21 | | Hermann Gruber:
On Balanced Separators, Treewidth, and Cycle Rank
CoRR abs/1012.1344: (2010) |
| 20 |  | Hermann Gruber:
On the descriptional and algorithmic complexity of regular languages.
Justus Liebig University Giessen 2010: 1-174 |
| 2009 |
|---|
| 19 | | Hermann Gruber,
Markus Holzer,
Michael Tautschnig:
Short Regular Expressions from Finite Automata: Empirical Results.
CIAA 2009: 188-197 |
| 18 | | Hermann Gruber,
Markus Holzer,
Martin Kutrib:
On Measuring Non-Recursive Trade-Offs
DCFS 2009: 141-150 |
| 17 | | Hermann Gruber,
Markus Holzer:
Tight Bounds on the Descriptional Complexity of Regular Expressions.
Developments in Language Theory 2009: 276-287 |
| 16 | | Hermann Gruber,
Markus Holzer,
Martin Kutrib:
More on the Size of Higman-Haines Sets: Effective Constructions.
Fundam. Inform. 91(1): 105-121 (2009) |
| 15 | | Hermann Gruber,
Markus Holzer:
Language operations with regular expressions of polynomial size.
Theor. Comput. Sci. 410(35): 3281-3289 (2009) |
| 2008 |
|---|
| 14 | | Hermann Gruber,
Markus Holzer:
Language Operations with Regular Expressions of Polynomial Size.
DCFS 2008: 182-193 |
| 13 | | Hermann Gruber,
Markus Holzer:
Provably Shorter Regular Expressions from Deterministic Finite Automata.
Developments in Language Theory 2008: 383-395 |
| 12 | | Hermann Gruber,
Jan Johannsen:
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity.
FoSSaCS 2008: 273-286 |
| 11 | | Hermann Gruber,
Markus Holzer:
Finite Automata, Digraph Connectivity, and Regular Expression Size.
ICALP (2) 2008: 39-50 |
| 2007 |
|---|
| 10 | | Hermann Gruber,
Markus Holzer:
Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP.
Developments in Language Theory 2007: 205-216 |
| 9 | | Hermann Gruber,
Markus Holzer,
Oliver Ruepp:
Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms.
FUN 2007: 183-197 |
| 8 | | Hermann Gruber,
Markus Holzer:
Computational Complexity of NFA Minimization for Finite and Unary Languages.
LATA 2007: 261-272 |
| 7 | | Hermann Gruber,
Markus Holzer,
Martin Kutrib:
More on the Size of Higman-Haines Sets: Effective Constructions.
MCU 2007: 193-204 |
| 6 | | Hermann Gruber,
Markus Holzer:
On the average state and transition complexity of finite languages.
Theor. Comput. Sci. 387(2): 155-166 (2007) |
| 5 | | Hermann Gruber,
Markus Holzer,
Martin Kutrib:
The size of Higman-Haines sets.
Theor. Comput. Sci. 387(2): 167-176 (2007) |
| 2006 |
|---|
| 4 | | Hermann Gruber,
Markus Holzer:
Results on the Average State and Transition Complexity of Finite Automata Accepting Finite Languages (Extended Abstract).
DCFS 2006: 267-275 |
| 3 | | Hermann Gruber,
Markus Holzer:
Finding Lower Bounds for Nondeterministic State Complexity Is Hard.
Developments in Language Theory 2006: 363-374 |
| 2 | | Hermann Gruber,
Markus Holzer:
Finding Lower Bounds for Nondeterministic State Complexity is Hard.
Electronic Colloquium on Computational Complexity (ECCC) 13(027): (2006) |
| 2005 |
|---|
| 1 | | 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: 272-283 |
Data released under the ODC-BY 1.0 license — See also our legal information page