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

What are the recent TCS books whose drafts are available online?

28 votes
Accepted

computing the minimal NFA for a DFA

23 votes

The origin of the notion of treewidth

20 votes
Accepted

What is the number of languages accepted by a DFA of size $n$?

20 votes

Are there any open problems left about DFAs?

19 votes
Accepted

Status of Cerny Conjecture?

16 votes
Accepted

What is an unambiguous language in the sense of Schützenberger?

16 votes
Accepted

What notable automaton models have polynomially-decidable containment?

14 votes
Accepted

When was co-NP introduced for the first time?

13 votes
Accepted

Ambiguity of regular expressions

13 votes

Open access journals

13 votes
Accepted

Generating all instances of a regular language up to a certain length

13 votes
Accepted

Regular expressions: Finding "negation" of regular expression?

12 votes

What are the recent TCS books whose drafts are available online?

12 votes

Funny TCS-related papers etc?

12 votes
Accepted

Lower bound for NFA accepting 3 letter language

12 votes
Accepted

Regular expressions without alternation

11 votes

In the neutral zone between polynomial and sub-exponential

10 votes
Accepted

Grid minor in digraphs

10 votes

Practical consequences of $Parity \notin AC^0$

9 votes
Accepted

Completeness and Context-Sensitive Languages.

9 votes

Progress on generalized star-height problem?

9 votes
Accepted

Savitch's use of measurability

9 votes
Accepted

Is DFA language inclusion decidable in quasi-linear time?

9 votes

Planarity of planar finite automata intersection

8 votes
Accepted

Survey on Erdős-Pósa?

8 votes
Accepted

Understanding graph minor theorem

7 votes
Accepted

Taxonomy of notable regular expression automata

7 votes
Accepted

Reducing the bandwidth of non-symmetric matrix

7 votes
Accepted

The complexity of conversion from a regular expression to a nondeterminsitic automata and back after changing initial and final states