Question: Exercise 6 : Inclusion and equivalence between NFA ( 1 0 pts + bonus 2 0 pts ) In this problem we assume that we
Exercise : Inclusion and equivalence between NFA pts bonus pts
In this problem we assume that we are considering NFAs without transitions. Given two NFAs we say that a relation is a simulation of by denoted by : if the following properties hold:
Whenever for every rin there is some so that for all ain
Whenever if then
If and are actually DFAs, show that an map : of DFAs is a simulation of by
Let : be a simulation of by Prove that for every win for every inhat there is some inhat so that
Conclude that
If is an NFA and is a DFA, prove that if then there is some simulation : of by Hint. Consider the relation ::hathatwin
Remark. If and are DFAs and then there may not exist any DFA map from to but above shows that there is always a simulation of by
Give a counterexample showing that is generally false for NFAs, ie if and are both NFAs and there may not be any simulation :
In order to salvage we modify the conditions of the definition of a simulation: we say that : is a generalized simulation or simulation if
Whenever for all ain if and then for every rin there is some so that
For all win with inhatinhat::
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
