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

2024-02-05 13:04:48

Browse Source
This commit is contained in:
Isaac Shoebottom
2024-02-05 13:04:48 -04:00
parent 9af7a8d126
commit 0920eafc89
3 changed files with 48 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -0,0 +1,15 @@
Lecture Topic: Non-determinism
# So Far
All of the finite automata have been deterministic. This means that for any combination of state and input symbol there is exactly one transition defined
There are advantages to this
- Easier to trace a string through the finite automata
Also some disadvantages
- Can make it harder to design
Example on whiteboard
In a non-deterministic finite automata (NFA), there are different paths, or choices you can make, so there can be more than one, or no transition defined for a given state.
To verify a string in a NFA, you need to follow each "choice" until a string completes, (ie, for two transitions defined, fork and check both paths)