Question: Exercise 6 : Inclusion and equivalence between NFA ( 1 0 pts + bonus 2 0 pts ) In this problem we assume that we

Exercise 6: Inclusion and equivalence between NFA (10 pts + bonus 20 pts)
In this problem we assume that we are considering NFAs without lon-transitions. Given two NFAs Ni=(Qi,,i,q0i,Fi),i=1,2, we say that a relation subeQ1Q2 is a simulation of N1 by N2, denoted by :N1N2, if the following properties hold:
(q01,q02)in.
Whenever (p,q)in, for every rin1(p,a), there is some sin2(q,a) so that (r,s)in, for all ain.
Whenever (p,q)in, if pinF1 then qinF2.
If N1 and N2 are actually DFAs, show that an F-map :N1N2 of DFAs is a simulation of N1 by N2.
2
Let :N1N2 be a simulation of N1 by N2. Prove that for every win**, for every q1inhat()q(q01,w), there is some q2inhat()2(q02,w) so that (q1,q2)in.
Conclude that L(N1)subeL(N2).
If N1 is an NFA and N2 is a DFA, prove that if L(N1)subeL(N2), then there is some simulation :N1N2 of N1 by N2. Hint. Consider the relation |):}{:hat()1(q01,w),q2=hat()2(q02,w),win**}.
Remark. If N1 and N2 are DFAs and L(N1)subeL(N2), then there may not exist any DFA map from N1 to N2, but above shows that there is always a simulation of N1 by N2
Give a counter-example showing that (3) is generally false for NFAs, i.e., if N1 and N2 are both NFAs and L(N1)subeL(N2), there may not be any simulation :N1N2.
In order to salvage (3), we modify the conditions of the definition of a simulation: we say that :N1N2 is a generalized simulation (or g-simulation) if
(q01,q02)in
Whenever (p,q)in, for all ain, if 1(p,a)O? and 2(q,a)O?, then for every rin1(p,a), there is some sin2(q,a) so that (r,s)in.
For all win** with q1inhat()1(q01,we)F1q2inhat()2(q02,w)F2(q1,q2)inL(N1)subeL(N2)g:N1N2:N1N2gN1N2gN1N2-1gN2N1?
Exercise 6 : Inclusion and equivalence between

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!