Hermann Gruber's user avatar
Hermann Gruber's user avatar
Hermann Gruber's user avatar
Hermann Gruber
  • Member for 13 years, 5 months
  • Last seen this week
3 votes

Different definitions of grammar complexity

3 votes

Defining regular language classes with disjoint union

3 votes

What are some examples of decidable Natural Problems outside of EEXP?

2 votes

Is it useful to "untangle" an NFA by converting to a regular expression and back

2 votes

Modify DCFG to enforce length limit

2 votes

Complexity of Yao's tiling number?

2 votes

When should one start looking at existing results in theoretical CS?

2 votes

P and Descriptive Complexity

2 votes

Converting Kuroda normal form rules to the Penttonen normal form

2 votes

Is there an algorithm for minimizing an NFA with respect to bisimilarity rather than language equivalence?

2 votes

What is the most powerful kind of parser?

2 votes

Resources on Cryptographic Applications of Expander Graphs

2 votes

Implemented code to compute pathwidth (= Node search number, vertex separation number, interval thickness)

2 votes

Existing technique to detect the clique and biclique cover the edges in a graph?

1 vote

What notable automaton models have polynomially-decidable containment?

1 vote
Accepted

Automata as term rewriting systems

1 vote
Accepted

Compressing grammars by introducing ambiguity and left-recursion

1 vote

Where and how did computers help prove a theorem?

1 vote

Where and how did computers help prove a theorem?

1 2
3