Computer Science
Kevin G's user avatar
Kevin G's user avatar
Kevin G's user avatar
Kevin G
  • Member for 10 years
  • Last seen more than 9 years ago
Profile Activity
Stats
232
reputation
17k
reached
2
answers
4
questions
Communities
Badges
1
gold badge
2
silver badges
7
bronze badges
Top tags
View all tags
5
Score
1
Posts
17
Posts %
5
Score
1
Posts
17
Posts %
2
Score
3
Posts
50
Posts %
2
Score
2
Posts
33
Posts %
2
Score
1
Posts
17
Posts %
0
Score
2
Posts
33
Posts %
Top posts
All Questions Answers
Score Newest
question
7
Constructing a PDA for the language $\{a^m b^n : m < 2n < 3m \}$
Oct 9, 2013
answer
5
If P = NP, how do I prove I can find the maximum clique in polynomial time?
Nov 20, 2013
question
3
Time Complexity of Simulating CA with TM
Nov 19, 2013
question
2
Proving Equivalence of 1-dimensional Cellular Automaton and Turing Machines
Oct 22, 2013
question
2
Proving $ \{ \langle D_1, ... ,D_K \rangle : \text{ where } D_i \text{ are DFAs and } {\bigcap}_{i=1}^k L(D_i) = \emptyset \} $ is NP-Hard
Nov 27, 2013
answer
2
Complements of Linear Bounded Automata?
Nov 20, 2013

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.