An old school project from 2019 that determines the accuracy of a DFA M in implementing the language L = {w| w has 1 as the middle bit} as a success rate over strings of length n.
Final Project Writeup.doc was not made by me. Only main.py.
-
Notifications
You must be signed in to change notification settings - Fork 0
patrickclank9/middle-bit-DFA
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
An school project from 2019 that determines the accuracy of a DFA M in implementing the language L = {w| w has 1 as the middle bit} as a success rate over strings of length n.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published