文章列表

• 1.计算理论 11-Church-Turing Thesis and Examples of Decidable Languages
• ...
• 2.计算理论 10-Equivalence of Non-deterministic and Deterministic TMs
• ...
• 3.计算理论 09-More TM design and Introduction to Non-deterministics TMs
• ...
• 4.计算理论 08-Introduction to Turing Machines and Computations
• ...
• 5.计算理论 07-Contex-Free Grammars and Push Down Automata
• ...
• 6.计算理论 06-The Pumping Lemma, and Introduction to CFLs
• ...
• 7.计算理论 05-Regular Expressions, Regular Languages and Non-regular Languages
• ...
• 8.计算理论 04-Regular Expressions
• ...
• 9.计算理论 03-Non-deterministic Finite-state Machines
• ...
• 10.计算理论 02-Regular Languages and Non-deterministics PSMs
• ...