集合、关系和语言 Sets, Relations, and Languages
有穷自动机 Finite Automata
上下文无关语言 Context-Free Languages
图灵机 Turing Machines
不可判定性 Undecidability
计算复杂性 Computational Complexity
NP完全性 NP-completeness
计算理论 (last edited 2008-02-23 15:34:55 by localhost)