The following pages link to Hermann Gruber (Q534358):
Displayed 34 items.
- Bounding the feedback vertex number of digraphs in terms of vertex degrees (Q534359) (← links)
- On minimal grammar problems for finite languages (Q1622981) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- On minimizing regular expressions without Kleene star (Q2140503) (← links)
- On 25 years of CIAA through the lens of data science (Q2164730) (← links)
- Language operations with regular expressions of polynomial size (Q2271463) (← links)
- More on deterministic and nondeterministic finite cover automata (Q2357103) (← links)
- On balanced separators, treewidth, and cycle rank (Q2375853) (← links)
- On the average state and transition complexity of finite languages (Q2465048) (← links)
- The size of Higman-Haines sets (Q2465049) (← links)
- From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity (Q2800411) (← links)
- On Measuring Non-Recursive Trade-Offs (Q2819383) (← links)
- More on Deterministic and Nondeterministic Finite Cover Automata (Q2947414) (← links)
- Finite Automata, Digraph Connectivity, and Regular Expression Size (Q3520302) (← links)
- Provably Shorter Regular Expressions from Deterministic Finite Automata (Q3533026) (← links)
- Simplifying Regular Expressions (Q3564869) (← links)
- Finding Lower Bounds for Nondeterministic State Complexity Is Hard (Q3617075) (← links)
- On knot polynomials of annular surfaces and their boundary links (Q3636903) (← links)
- Tight Bounds on the Descriptional Complexity of Regular Expressions (Q3637232) (← links)
- Short Regular Expressions from Finite Automata: Empirical Results (Q3637356) (← links)
- (Q4994933) (← links)
- (Q5146524) (← links)
- PROVABLY SHORTER REGULAR EXPRESSIONS FROM FINITE AUTOMATA (Q5168416) (← links)
- (Q5403035) (← links)
- Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms (Q5426025) (← links)
- Inapproximability of Nondeterministic State and Transition Complexity Assuming P ≠ NP (Q5428232) (← links)
- Optimal Lower Bounds on Regular Expression Size Using Communication Complexity (Q5458365) (← links)
- Developments in Language Theory (Q5473678) (← links)
- More on the Size of Higman-Haines Sets: Effective Constructions (Q5901451) (← links)
- More on the Size of Higman-Haines Sets: Effective Constructions (Q5902078) (← links)
- Optimal Regular Expressions for Palindromes of Given Length (Q6168470) (← links)
- The pumping lemma for regular languages is hard (Q6199869) (← links)
- Enumerating regular expressions and their languages (Q6232508) (← links)
- Estimates for the minimal crossing number (Q6472664) (← links)