Skip to main content
Theoretical Computer Science
Klaus Draeger's user avatar
Klaus Draeger's user avatar
Klaus Draeger's user avatar
Klaus Draeger
  • Member for 13 years, 6 months
  • Last seen this week
Profile Activity
Stats
2,530
reputation
34k
reached
35
answers
0
questions
Communities
View all
Badges
View all badges
1
gold badge
23
silver badges
19
bronze badges
Top tags
View all tags
76
Score
11
Posts
31
Posts %
63
Score
5
Posts
14
Posts %
35
Score
8
Posts
23
Posts %
23
Score
4
Posts
11
Posts %
19
Score
5
Posts
14
Posts %
19
Score
3
Posts
9
Posts %
Top posts
View all questions and answers
answer
25
Why is non-determinism (Push-down automata) necessary?
Jan 10, 2012
answer
15
Explicit mu-recursive expression for Ackerman function
Jun 8, 2011
answer
13
Is the Set of all Primitive Words a Prime Language?
Apr 24, 2019
answer
13
Isomorphic graph embeddings in the Euclidean Space
Aug 19, 2020
answer
11
Measurable language which is not $\omega$-regular
Mar 25, 2013
answer
9
CTL and LTL logic difference
Apr 1, 2014
answer
9
Verifying a subtlety of Karp's original proof that SAT has a polynomial time reduction to 3SAT
Mar 14, 2016
answer
8
Constant in Komlos conjecture
Aug 19, 2015
answer
8
Directed multigraphs as minimal automata
Oct 7, 2015
answer
7
The number of states of local automata
Jan 16, 2014
Top network posts
View all network posts
15
How to prove that the Fibonacci sequence is periodic mod 5 without using induction?
12
Why is the set of all regular expressions classified as context-free, instead of regular?
12
Is this problem solvable in polynomial time?
10
DFA for accepting all binary strings of form power of $n$ (not divisible by $n$) i.e. $n^k$ for given $n$
9
Unprovable Post correspondence problem instance