find a regular expression for w such that it does not contain $ aab $ , where w is the strings of $a$'s and $b$'s .
ans: I know how to draw the same question with $ aab $ , but cant understand how to proceed for this question.
Asked
Active
Viewed 39 times
0
-
Every $a$ (except for any $a$'s at the end of the string) must be immediately followed by a $b$. You should be able to construct an r.e. that does that... – rogerl Sep 26 '14 at 03:27
1 Answers
0
There is an algorithm for converting a FA into a RE. Since you said you can draw the FA, why not apply that algorithm?
MJD
- 65,394
- 39
- 298
- 580