2022 Developer Survey is open! Take survey.
user avatar
user avatar
user avatar
Hermann Gruber
  • Member for 11 years, 6 months
  • Last seen this week
10 answers
68 votes
8k views
41 bookmarks
Are there any open problems left about DFAs?
17 answers
67 votes
4k views
34 bookmarks
Applications of TCS to classical mathematics?
3 answers
50 votes
7k views
25 bookmarks
How to find interesting research problems
17 answers
46 votes
4k views
31 bookmarks
Physics results in TCS?
4 answers
43 votes
2k views
20 bookmarks
Why have we not been able to develop a unified complexity theory of distributed computing?
5 answers
41 votes
5k views
22 bookmarks
What would you advise someone who wants to do research as a hobby?
8 answers
36 votes
3k views
15 bookmarks
Problems with big open complexity gaps
3 answers
35 votes
973 views
21 bookmarks
An Anthology of Complexity Assumptions
2 answers
29 votes
2k views
8 bookmarks
Conditions for NFA universality
1 answer
28 votes
1k views
9 bookmarks
Are there any public synchronous discussion forums (slack, discord, etc.) for TCS
1 answer
25 votes
2k views
10 bookmarks
Deciding emptiness of intersection of regular languages in subquadratic time
2 answers
22 votes
1k views
4 bookmarks
Protocol partition number and deterministic communication complexity
5 answers
22 votes
3k views
8 bookmarks
Program for computing Tree decomposition of a graph
3 answers
21 votes
825 views
6 bookmarks
Complexity of intersection of regular languages as context-free grammars
2 answers
21 votes
2k views
6 bookmarks
Languages that we cannot (dis)prove to be Context-Free
5 answers
20 votes
793 views
6 bookmarks
What notable automaton models have polynomially-decidable containment?
5 answers
20 votes
2k views
5 bookmarks
A special class of languages: “circular” languages. Is it known?
1 answer
19 votes
440 views
5 bookmarks
Algorithmic advantages of pathwidth over treewidth
2 answers
19 votes
455 views
2 bookmarks
"Embedding" a language in itself
2 answers
18 votes
789 views
7 bookmarks
Bounds on the size of the smallest NFA for L_k-distinct
1 answer
16 votes
850 views
6 bookmarks
Completeness and Context-Sensitive Languages.
1 answer
16 votes
378 views
5 bookmarks
Compared growth of the number of syntactic classes and Nerode classes.
2 answers
16 votes
1k views
4 bookmarks
minimizing size of regular expression for finite sets
5 answers
16 votes
2k views
3 bookmarks
Why do TCS papers have author names in alphabetical order of their surnames?
1 answer
16 votes
488 views
6 bookmarks
Can we approximate the number of words accepted by an NFA?
1 answer
15 votes
436 views
7 bookmarks
Lower bounds on the size of CFGs for specific finite languages
1 answer
14 votes
591 views
4 bookmarks
Minimizing residual finite state automata
3 answers
14 votes
954 views
3 bookmarks
The significance of state complexity in automata and regular languages?
0 answers
14 votes
555 views
5 bookmarks
Approximation algorithm for Minimum Fill-In and/or minimum elimination ordering (for directed graphs)
1 answer
14 votes
3k views
1 bookmarks
minimizing size of regular expression