Scribd
Upload
13 views2 pages

Formal Material

This document contains practice problems related to finite automata, regular expressions, and context-free grammars. It includes tasks like: 1) Converting NFAs to equivalent DFAs and minimizing DFAs. 2) Converting between finite state machines and regular expressions. 3) Constructing finite state machines and regular grammars from regular expressions. 4) Converting between different types of grammars such as context-free grammars and Greibach normal form.

Uploaded by

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

Formal Material

This document contains practice problems related to finite automata, regular expressions, and context-free grammars. It includes tasks like: 1) Converting NFAs to equivalent DFAs and minimizing DFAs. 2) Converting between finite state machines and regular expressions. 3) Constructing finite state machines and regular grammars from regular expressions. 4) Converting between different types of grammars such as context-free grammars and Greibach normal form.

Uploaded by

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

FLAT MID-1

UNIT – 1

1. Convert the following NFA with ε to NFA without ε

2. Convert NFA equivalent to DFA

3. Convert NFA with ε to equivalent DFA, Here p is initial state & r is final state

a b c ε
p p q r φ
q q r φ p
r r φ p q
4. Minimize finite automation given below and show both the given and reduced are equivalent
Here q0 is initial state & q6 is final state.

a b
q0 q0 q3
q1 q2 q5
q2 q3 q4
q3 q0 q5
q4 q0 q6
q5 q1 q4
q6 q1 q3
5. Convert the following Moore machine into equivalent Mealy machine

a b δ
q0 q0 q2 1
q1 q3 q2 0
q
q2 q1 1
2
q3 q0 q3 1

6. Convert the following Mealy machine into equivalent Moore machine

input 0 input 1
state
state o/p state o/p
q0 q1 N q2 N
q1 q1 Y q2 N
q2 q1 N q2 Y
UNIT – 2

1. Prove (1+00*1)+(1+00*1)(0+10*1)*(0+10*1)=0*1(0+10*1)*
Show that (0*1*)*=(0+1)*
Prove ε+1*(011)*(1*(011)*)*=(1+011)*
2. Write the IDENTITY RULES & ARDENS THEORM
3. Construct DFA for the Regular Expression(ab∪aba )∗a
4. Convert the following Finite Automata to Regular Expression
a) 1=1a+2b+ε 2=1b+2a
b) 1=3a+ε 2= 1(a+b)+2a+3b 3=2b
5. Construct Finite Automata to accept regular expressions (0+1)*(00+11)(0+1)*
6. Convert the following Finite Automata to Regular Expression
a) P=Pb+Qb+ ε Q=Pa+Qb
Where p,Q are states a,b are inputs

UNIT – 3

1. Construct regular grammar for the regular expression a*b(a+b)*


2. Construct left linear grammar for the following regular expression
10+(0+11)0*1
3. Convert the following Context Free Grammar to Griebech Normal Form
A1->A2A3 A2->A3A1/b A3->A1A2/a

You might also like