What is the regular expression for the language contains set of all strings at least two b’s over an alphabet ∑={a,b}
Answers
Answered by
0
Answer:
y is present in the US government wants to do it for the child chapter of Alpha phi Omega chapter hai ki positive ya no e I have to do so km du ho gaya paper hai to bahan ko milna chahiye tha ki nhi h abhi bhi nhi hua tha
Similar questions