Q1. make conversion NFA to DFA
Q2. test if NFA accept specific string
Q1. convert context-free grammar G to Chomsky normal form
Q2. implement CYK algorithm to test if CNF grammar accept specific string
Q1. Implement Universal Turing Machine
-
Notifications
You must be signed in to change notification settings - Fork 0
aeri206/Automata-Theory
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description or website provided.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published