11 lines
507 B
Markdown
11 lines
507 B
Markdown
Lecture Topic: More NFA
|
|
|
|
Design a state diagram for an NFA that accepts
|
|
$$L = \{w \in \{a,b,c\}^* | \text{w starts with abc, ends with aab, and contains the substring bb}\}$$
|
|
So, the first three states must be connecting a, b and c
|
|
|
|
(D) -a, b, c> (D)
|
|
(F) -a, b, c> (F)
|
|
(A) -a> (B) -b> (C) -c> (D) -b> (E) -b> (F) -a> (G) -a> (H) -b> ((I))
|
|
|
|
It's important that on D and F, that b is allowed to loop, as if it did not, some valid strings would not be accepted, as it would only allow for two bs in the middle |