Question: A . Let S = { 0 , 1 , 2 } . Give an NFA for the language L containing all string in

A. Let S ={0,1,2}. Give an NFA for the language L containing all string in \Sigma *
which have a 0 or a 2 in the last four posiBons. For example, 110111 and 011121 are
both in L, but 0201111 is not. NoBce that strings of length four or less are in L exactly
when they contain a 0 or a 2.
B. Let \Sigma ={a, b}. Design NFA for the language L consisBng of strings in which the final
leZer has appeared before. SoluBon: NFA is given in following

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 Databases Questions!