ttnick's user avatar
ttnick's user avatar
ttnick's user avatar
ttnick
  • Member for 6 years
  • Last seen this week
8 votes
Accepted

Do Turing machines have memory registers?

7 votes

Length of a regular expression

5 votes

Understanding Time Complexity

5 votes
Accepted

Ω(f(x)) and worst case analysis

4 votes
Accepted

Using Myhill-Nerode to prove that language is not regular

4 votes
Accepted

Assumption: A PSPACE-hard problem can be solved in polynomial time

4 votes

Are Linear Bounded Automatons Turing Complete?

3 votes
Accepted

Is "imperative computing" just a fancy way of saying "scripting"? Or is there more to it?

3 votes

Fantasy premier league dream team algorithm?

3 votes
Accepted

Decidability of a set containing first symbols of elements of a decidable set

3 votes
Accepted

Where is the second face in a graph with 3 nodes?

3 votes

Are the implications of the diagonalization language different from those of the halting problem?

3 votes
Accepted

Do the classes $P$ and $NP$ include problems faster then polynomial?

3 votes
Accepted

The set of all eventually periodic words is not Buchi Recognizable?

3 votes

DFA for Strings with third symbol from RHS as 1

3 votes

Prove no DFA with four states can accept L={111}

2 votes
Accepted

A task-scheduling problem as a matroid (CLRS book)

2 votes
Accepted

How to check $L$ is regular or not

2 votes
Accepted

Language to regular expression to prove it is regular

2 votes
Accepted

Show that the regular language is contained in another

2 votes
Accepted

How does this reduction to prove undecidability account for epsilon?

2 votes
Accepted

Making a CFG for a^i b^j c^k such that i+j = 3k

2 votes

Number of states in NFA and DFA accepting strings from length 0 to n with alphabet Σ= {0,1}

2 votes
Accepted

Is the set of all Context free languages a Context sensitive Language? ( can we build a LBA that decides whether a given language is CFL or not?)

2 votes
Accepted

Problem with forming a context-free grammar describing a language

2 votes
Accepted

prove A is co-re

2 votes

Simple path in a Finite Acceptor

2 votes

Both a language and its complement are not context free

2 votes

How to calculate machine epsilon

2 votes

Does White never lose in Chess if Chess is solved?