Question

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 ​

Answer 1

Answer: A regular expression, the first symbol should be 1, and the last symbol should be 0. The r.e. is as follows:

R = 1 ( 0+1 )*0

Explanation: Please Mark me as brainliest