Automata Theory May 2022

Paper Solutions by Kamal Sir

Regular Expressions:
Q2C) Give Regular Expressions for
i) Strings that starts with 10 and ends with 01 over 0 and 1.
ii) Strings that contains exactly 3 occurrence of b’s over a and b.
Link: https://youtu.be/yD2oTG-XVls

NFA and DFA:

Q2 A Convert NFA to DFA

Link: https://youtu.be/TmZM4YVpcDc

Q4 C Construct NFA for “0 or more number of 0’s followed by 0 or more

number of 1’s followed by 0 or more number of 2’s”. Convert this to DFA.
Link: https://youtu.be/sLDkNu4Qjgk
Moore and Mealy Machine:
Q2B) Design Moore Machine
to output ‘x’ if the input is ending in 101 , output ‘y’ if input is ending in 110
and ‘z’ otherwise over ∑ = {0, 1}
Link: https://youtu.be/uWMT3fHJs_w

Grammars:
Q4A) Explain Chomsky’s Hierarchy with neat diagram.
Link: https://youtu.be/PQJyCywaDY4

Q2D) Consider the following grammar:

S → aAS | a
A → SbA | SS |ba
Derive “aabbaa” using LMD and RMD.
Link: https://youtu.be/VLXOqeDgfmI

Q1D) What is ambiguous grammar? Check if the following grammar is

ambiguous or not by generating:
(x + 2.0) * y / (z – 6.0)
S ➔ S + S | S * S | S – S | S / S | (S) | var | const
Link: https://youtu.be/mToC78hPp5k
 Push Down Automata:
Q3C) Design PDA to recognize
L = {wxwr | w – any combination of a’s and b’s
wr is reverse of w }

Link: https://youtu.be/LfzTbdK3cx4

Turing Machine:
Q3B) TM to add two unary numbers.
Link: https://youtu.be/IDBIXkBdyqE

Python Full Stack Java Full Stack JavaScript Full Stack

• Complete Python • Core Java • JavaScript

• Django • Advanced Java • React JS
• Machine Learning • Java Web App • Node + Express JS
• MySQL • Android App • Firebase & MongoDB