Scribd
Upload
53 views

Assignment For Slow Learners (Automata and Theory)

The document provides assignments related to automata and compiler design for students. It includes tasks to find regular expressions, convert between DFAs and NFAs, prove properties of languages, and derive expressions using grammars.

Uploaded by

vikas
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
53 views

Assignment For Slow Learners (Automata and Theory)

The document provides assignments related to automata and compiler design for students. It includes tasks to find regular expressions, convert between DFAs and NFAs, prove properties of languages, and derive expressions using grammars.

Uploaded by

vikas
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

DEPARTMENT OF INFORMATION TECHNOLOGY

Assignment for Slow Learners

Automata and Compiler Design (IT3202)

B. Tech (IT), VI sem., Even 2023-24

Due Date: Complete and submit 5 days before ETE exam

1. Find out the following over Ʃ = {0, 1} -

a. A DFA for the set of all strings that don’t include substring “000”.
b. An NFA for the set of all strings of language L, where L = {aw1aa w2a: w1, w2 є {0, 1}*}.
c. A Regular Expression for the set of all strings that contains substring “10” exactly once.
d. Grammar G for the set of all strings of language L such that L (G) = {0n1n, n ≥ 0}.
2. Prove that for every NFA, there exists a DFA, which simulates the behavior of NFA. Convert the
following NFA into an equivalent DFA over Ʃ = {0, 1}.

δ 0 1
→p {p, r} {q}
q {r, s} {p}
*r {p, s} {r}
*s {q, r} Φ

3. Consider the following є – NFA M over Ʃ = {0, 1}.

i. Compute the є – Closure of each state.


ii. Convert the automaton M to a DFA.
iii. Show the processing of the input string “00111”.
4. Prove that the language pal of palindromes over Ʃ = {0,1} cannot be accepted by any FA, and it is
therefore not regular.
5. Compare 2 DFA’s M1 and M2 over Ʃ = {c, d} and design the final DFA if possible.
6. Construct the minimum state automaton equivalent to the DFA over Ʃ = {a, b} whose
transition table is given below.
δ a b
→q1 q2 q1
q2 q1 q3
q3 q4 q2
*q4 q4 q1
q5 q4 q6
q6 q7 q5
q7 q6 q7
q8 q7 q4
7. Find the Regular Expression of given NFA M1 over Ʃ = {a, b} using ARDEN’s Theorem –

8. Consider the grammar of simple expressions –


E → I | E+E | E*E | (E)
I → a | b| Ia | Ib | I0 |I1
Solve the expression (a101 + b1) * (a + b) using Rightmost Derivation.

You might also like