-3
$\begingroup$

How to construct regular expression for language L={a,b,c} which contain all words starts with bab and ends with babc?

$\endgroup$
  • 1
    $\begingroup$ Separately for start and end, with due care in combining both. $\endgroup$ – greybeard Jun 8 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 Postolova Jun 8 at 16:52
0
$\begingroup$

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.

| cite | improve this answer | |
$\endgroup$
  • $\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$ – Viktorija Postolova Jun 8 at 16:49

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.