Computer Science, asked by arsalanghori234, 5 months ago

Write the regular expression for the language starting and ending with b and not having consecutive c's over ∑ = {a,b,c} and vonvert the regular expression into DFA ​

Answers

Answered by Ayushmaurya0175
0

r.e. = (b* (aaa)* b*)*

Similar questions