P1 P2
P1 P2
P1 P2
(P2) Construct Non Deterministic Finite Automata (NDFA/NFA) for the Following:
(1)L= (a*+b*).
(2) L={w | w having first and last symbols same, wƐ{a,b}*} .
(3)Using ε-transitions, design NFA for accepting the language, L={(ab)*U aa*}.
(4)L=(aa)*+(aaaa)*.
(5)L={w | w ended with either ab or ba}.
(6)Design a NFA to recognize the following set of strings , 0101,101 and 011. Assume the alphabet is {0,1}.
(7)The set of all strings over {0,1,2,3,….,9}, such that the final digit appears before.
(8)Design NFA no more than 5 states for ,{ababn |n>=0} U{aban |n>=0}.
(9)Design NFA with 3 states that accepts , L={an |n>=1}U {bm ak |m>=0,k>=0}.
(10)Design NFA with out λ-transition for language , L={a}U {bn |n>=1}.
(11)L={an | n>=0}U{bn a|n>=1}.
(12)All strings that contains the substring 0|01(5 states).
(13)(11+11111)*
(14)L=a*b*c*.
(15)L={vwv| v,wƐ{a,b}*, |v|=2}.
(16)L={an | n is either a multiple of three or a multiple 5}.