THEORY OF COMPUTATION

 Theory of computation is all about what kind of things you can compute mechanically and how fast and how much space does it required to do so. 

RELATED POSTS:

1.    Find an nfa that accepts the language L (aa* (a + b))- solution of Peter Linz

2.    Write regular expressions for the following languages on {0, 1}- Solution of Peter Linz

3.    Give regular expressions for the following languages on Σ = {a, b, c}- solution of Peter Linz

4.    Does the expression ((0 + 1) (0 + 1)*)* 00 (0 + 1)* denote the language L(r) = {w ∈ Σ*: w has at least one pair of consecutive zeros}, for Σ = {0, 1} ?

5.    Find all strings in L((a + b) b (a + ab)*) of length less than four.

6.    For ∑ ={ a,b }, construct dfa's that accept the sets consisting of

7.    Consider the set of strings on {0,1} defined by the requirements below. For each construct an accepting DFA-solution of peter linz

8.    Minimize the following DFA using table filling method or Myhill-Nerode Theoram

9.    ASSIGNMENT OF AUTOMATA THEORY

10.    Design an NFA which accepts all the strings over {0,1} which ends with '01'. Construct the equivalent DFA of this NFA.

11.    Design an NFA for a language that accepts all strings over {0,1} in which the second last symbol is always '1', then convert it to it's equivalent DFA.

12.     THEORY OF COMPUTATION MCQ QUESTIONS

13.    Construct a DFA that accepts any strings over {a,b} that doesn't contain the string aabb in it.