文件名称：cse480-notebooks
文件大小：4.78MB
文件格式：ZIP
更新时间：2024-04-06 22:31:00
JupyterNotebook
cse480-notebooks
【文件预览】：
cse480-notebooks-master
----04_2_NFA_Problems.ipynb(20KB)
----10_1_Readiness_Assurance_Test.ipynb(3KB)
----03_1_DFA_Basics.ipynb(5.73MB)
----08_2_Ponder_and_Prove_Turing_Machines.ipynb(7KB)
----01_1_Overview_Of_Course.ipynb(16KB)
----10_4_Answer_Selected_Questions.ipynb(13KB)
----04_4_More_DFA_Intersection.ipynb(66KB)
----01_4_Diophantine.ipynb(3KB)
----04_1_NFA_Basics.ipynb(14KB)
----04_3_DFA_to_NFA_and_NFA_to_DFA.ipynb(6KB)
----06_1_Readiness_Assurance_Test.ipynb(14KB)
----05_1_NFA_and_RE_Problems.ipynb(19KB)
----02_1_Language_Basics.ipynb(8KB)
----07_0_Readiness_Assurance_Test.ipynb(3KB)
----03_2_DFA_Design_Exercise.ipynb(6KB)
----02_2_Language_Details.ipynb(41KB)
----04_5_Mathy_Graphs.ipynb(65KB)
----10_3_Universal_Turing_Machines_and_Computer_Programs.ipynb(21KB)
----01_3_Python_Basics.ipynb(6KB)
----09_1_RAT_on_TM_and_TSL.ipynb(11KB)
----06_4_Answer_Selected_Questions.ipynb(22KB)
----07_3_Answer_Selected_Questions.ipynb(11KB)
----06_3_More_Proofs.ipynb(10KB)
----03_3_DFA_Algorithms.ipynb(61KB)
----08_1_Designing_Turing_Machines.ipynb(16KB)
----07_2_Calculator_with_Parse_Tree_Drawing.ipynb(19KB)
----proof_problems.ipynb(4KB)
----02_3_nthnumeric.ipynb(3KB)
----11_1_Readiness_Assurance_Test.ipynb(8KB)
----07_1_Assorted_Topics_from_Chapters_11__and_12.ipynb(27KB)
----09_3_About_Computable_and_Uncomputable_Functions.ipynb(25KB)
----01_2_Jupyter_Basics.ipynb(50KB)
----03_4_DFA_Examples.ipynb(5KB)
----02_4_DeMorgan.ipynb(5KB)
----02_5_Language_Tasks.ipynb(8KB)
----11_2_Ponder_and_Prove_NP_Completeness.ipynb(8KB)
----09_2_Ponder_and_Prove_Recursively_Enumerable_and_Recursive_Sets.ipynb(6KB)
----11_3_Are_You_SATisfied.ipynb(167KB)
----03_5_DFA_Problems.ipynb(11KB)
----05_2_NFA_to_RE_Conversion.ipynb(46KB)
----10_2_Ponder_and_Prove_the_Post_Correspondence_Problem.ipynb(23KB)
----08_3_Answer_Selected_Questions.ipynb(44KB)
----03_6_DFA_Workbook.ipynb(358KB)
----06_2_The_Regular_Pumping_Lemma.ipynb(2KB)