How to construct regular expression for language L={a,b,c} which contain all words starts with bab and ends with babc?
$\begingroup$
$\endgroup$
2
-
1$\begingroup$ Separately for start and end, with due care in combining both. $\endgroup$– greybeardCommented Jun 8, 2020 at 12:03
-
$\begingroup$ No separately.....with due care in combining both.....and with respect overlap bab with babc (here I have a problem) $\endgroup$– Viktorija PostolovaCommented Jun 8, 2020 at 16:52
Add a comment
|
1 Answer
$\begingroup$
$\endgroup$
1
RE-(bab)star[a+b+c]star(babc)star..well you just need to care about the starting symbols and the ending symbols. And that's it. Refer to the arithmetic rules of regular expressions.
-
$\begingroup$ Yes, thank you Satyam Bhardwaj, I write answer like this, but prof didn't admit....He comented about overlap bab with babc....So I need help.... $\endgroup$ Commented Jun 8, 2020 at 16:49