Download presentation

Presentation is loading. Please wait.

Published byAstrid Blakeway Modified over 2 years ago

1
PrasadL12NFA2DFA1 NFA to DFA Conversion Rabin and Scott (1959)

2
PrasadL12NFA2DFA2 Removing Nondeterminism By simulating all moves of an NFA-λ in parallel using a DFA. λ-closure of a state is the set of states reachable using only the λ-transitions.

3
PrasadL12NFA2DFA3 NFA-λ q1 p1 q2 p3 p2 a λ λ λ p4 a p5 λ

4
PrasadL12NFA2DFA4

5
PrasadL12NFA2DFA5 Transition Function

6
PrasadL12NFA2DFA6

7
PrasadL12NFA2DFA7 Equivalence Construction Given NFA-λ M, construct a DFA DM such that L (M) = L (DM). Observe that –A node of the DFA = Set of nodes of NFA-λ –Transition of the DFA = Transition among set of nodes of NFA- λ

8
PrasadL12NFA2DFA8 {q1,…,qn}{p1,…,pm} a For every pi, there exists qj such that

9
PrasadL12NFA2DFA9 Start state of DFA = Final/Accepting state of DFA = All subsets of states of NFA-λ that contain an accepting state of the NFA-λ Dead state of DFA =

10
PrasadL12NFA2DFA10 Example q0 q1 q2 a a a b λ c a+c*b*

11
PrasadL12NFA2DFA11 {q0} {q0,q1,q2} a b c

12
PrasadL12NFA2DFA12 {q0} {q0,q1,q2} a b c {q1} {q1,q2} a b c a,b,c

13
PrasadL12NFA2DFA13 {q1} a,c b {q1,q2} a c {q1} b

14
PrasadL12NFA2DFA14 Equivalent DFA {q0} {q0,q1,q2} {q1} {q1,q2} a a a,c a a,b,c b b bb,c c c

Similar presentations

OK

CS412/413 Introduction to Compilers Radu Rugina Lecture 3: Finite Automata 25 Jan 02.

CS412/413 Introduction to Compilers Radu Rugina Lecture 3: Finite Automata 25 Jan 02.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on structural changes in chromosomes ppt Conjunctions for kids ppt on batteries Ppt on accounting standard 14 Ppt on rf based dual mode robot Download ppt on hazards of mining Ppt on zener diode application Ppt on trial and error quotes Presentation ppt on leadership Ppt on model view controller diagram Ppt on computer languages of the 80's