Use the construction in the proof of $\text{Theorem 1.45}$ to give the state diagrams of $\text{NFA’s}$ recognizing the union of the languages described in
@Lakshman Patel RJIT
the actual question is
a. L1={w| w begins with a 1 and ends with a 0} union L2={w| w contains at least three 1s}
b. L1={w| w contains the substring 0101 (i.e., w = x0101y for some x and y)} union L2={w| w doesn’t contain the substring 110}
pls edit the question
@aditi19
Now i edit please check it.
a. L=1(0+1)*0+0*10*10*1(0+1)*
64.3k questions
77.9k answers
244k comments
80.0k users