Profile Activity

ttnick

Network Profile

Reputation

763

763
750
738

Oct
Nov
Dec
Jan

Top tag

formal-languages

Next privilege

1,000 Rep.

See votes, expandable usercard

Badges

10

Newest

Custodian

Next badge

0/1

Impact

4 posts edited

9 helpful flags

88 votes cast

summary answers questions tags badges favorites bounties reputation all actions

Answers (27)

votes activity newest

3	Fantasy premier league dream team algorithm?
3	Assumption: A PSPACE-hard problem can be solved in polynomial time
3	Do the classes $P$ and $NP$ include problems faster then polynomial?
3	Are the implications of the diagonalization language different from those of the halting problem?
3	Where is the second face in a graph with 3 nodes?

View more →

Reputation (763)

+10	Halting problem of TM which recognize recursive languages is undecidable?
+15	Is the set of context free grammars that generate all words in co-RE?
+10	Prove: if $\delta_D(q0, w) = p$ then $\delta_N(q0, w) = {p}$
+15	The set of all eventually periodic words is not Buchi Recognizable?

View more →

Questions (0)

votes activity newest

This user has not asked any questions

Tags (40)

9 formal-languages × 7	6 complexity-theory × 2
6 turing-machines × 8	5 context-free × 5
6 computability × 4	4 automata × 3
6 finite-automata × 4	4 undecidability × 3
6 regular-languages × 3	3 regular-expressions × 2

View more →

Accounts (13)

	Computer Science	763 rep	10
	TeX - LaTeX	115 rep	4
	Mathematics	106 rep	4
	Stack Overflow	101 rep	5
	Spanish Language	101 rep	1

Badges (10)

recent class name

Custodian	Supporter
Citizen Patrol	Commentator
Informed	Editor
Explainer	Teacher
Critic	Autobiographer

Active bounties (0)

active offered earned

This user has no active bounties

Votes Cast (88)

all time			by type
53	up		46	question
35	down		42	answer

Computer Science Stack Exchange works best with JavaScript enabled