Kevin G

Member for 10 years, 2 months
Last seen more than 9 years ago

Summary

Reputation

232

232
217
202

2019
2020
2021
2022

Top tag

time-complexity

Next privilege

250 Rep.

View close votes

Badges

1

2

7

Newest

Famous Question

Next badge

0/1

Critic

Questions

Score Activity Newest Views

7

Constructing a PDA for the language $\{a^m b^n : m < 2n < 3m \}$

Oct 9, 2013

3

Time Complexity of Simulating CA with TM

Nov 19, 2013

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

2

Proving Equivalence of 1-dimensional Cellular Automaton and Turing Machines

Oct 22, 2013

Answers

Score Activity Newest

5

If P = NP, how do I prove I can find the maximum clique in polynomial time?

Nov 20, 2013

2

Complements of Linear Bounded Automata?

Nov 20, 2013

Tags

View all 10 tags

time-complexity

5

Score

1

post

graphs

5

Score

1

post

turing-machines

2

Score

3

posts

formal-languages

2

Score

2

posts

linear-bounded-automata

2

Score

1

post

Reputation

+10

Complements of Linear Bounded Automata?

+30

Constructing a PDA for the language $\{a^m b^n : m < 2n < 3m \}$

+10

Time Complexity of Simulating CA with TM

+10

Proving Equivalence of 1-dimensional Cellular Automaton and Turing Machines

Badges

View all badges

1

gold badge

Famous Question

Apr 17, 2020

2

silver badges

Notable Question

Oct 17, 2016
Yearling

Nov 13, 2019

7

bronze badges

Citizen Patrol

Nov 20, 2013
Teacher

Nov 20, 2013
Popular Question

Nov 19, 2014

Accounts

Computer Science

232
1
2
7

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast

24

upvotes

11

question votes

13

answer votes