Scribd
Upload
21 views

Assignment 1

The document outlines an assignment with 10 questions related to theory of computation topics including proving languages are regular or non-regular, constructing context-free languages from grammars, converting between regular expressions, finite automata, and regular languages.

Uploaded by

Jagadeesh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
21 views

Assignment 1

The document outlines an assignment with 10 questions related to theory of computation topics including proving languages are regular or non-regular, constructing context-free languages from grammars, converting between regular expressions, finite automata, and regular languages.

Uploaded by

Jagadeesh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Indian Institute of Information Technology,

Assignment.
Design and Manufacturing Kurnool
Deadline: 20 Oct, 2022
www.iiitk.ac.in
Time 12.30 pm
CS303T Theory of Computation
Total: 10 Marks
Instruction: Write the assignment problems in A4 sheets only.

Answer all the Questions

1. Prove that the following languages are not regular:


(a) L1 = {0n | n is a perfect square}.
(b) L2 = {x ∈ {0, 1}∗ |x = ww̄}, here w̄ formed from w by replacing 1’s with 0’s and
vice-versa.
2. Prove that the following languages are regular. Assume that the language L is regular.
(a) L4 = {w | w ∈ L, but no prefix of w is in L}.
(b) L5 = {x ∈ {0, 1}∗ | for some x such that |x| = |w|, wx ∈ L}.
3. Construct a context-free language (CFL) from the context-free grammar (CFG) G6 =
({S}, Σ = {a, b}, R, S), where the production rule R is defined as S → aSbS | bSaS | .
Note: You may use the mathematical induction to construct the language.
4. Construct a regular expression corresponding to the CFG G7 = (V = {S, A, B}, Σ =
{0, 1}, R, S), where the production R is defined as S → A1B, A → 0A | , B →
0B | 1B | .
5. (DFA Minimization) Construct a minimum-state equivalence of Deterministic Finite
Automata (DFA) given below,
6. Convert the following finite automata into Regular Expression (RE).

7. (RE to NFA) Convert the regular expression (a+b)+ b∗ into a Non-deterministic Finite
Automata (NFA).
8. (DFA to RE) Construct a regular expression for the language L = {w | w does not
contains contains the sub-string 110}.
9. (NFA to DFA) Convert the following NFA to an equivalent DFA.

10. Construct a DFA for the language of strings that do not contain the string 001 as a
sub-sequence.

You might also like