IsaacShoebottom/Notes
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

2024-02-09 12:55:55

Browse Source
This commit is contained in:
Isaac Shoebottom
2024-02-09 12:55:55 -04:00
parent 0cd954d3bc
commit 7927ed0772
2 changed files with 17 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
UNB/Year 4/Semester 2/CS2333/2024-02-09.md Normal file
View File

@ -0,0 +1,11 @@
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