Learning notes of Computer Science
Theory of Computation
- Regular Language | 正则语言
- Regular Expression (RegEx)
- Final Automaton (FA)
- Nondeterministic Final Automaton (NFA)
- Generalized Nondeterministic Finite Automaton (GNFA)
- Pumping lemma for regular languages
- Context-Free Language (CFL) | 上下文无关语言
- Context-Free Grammar (CFG)
- Pumping lemma for CFL
- Pushdown Automaton (PDA) | 下推自动机
- Turing Machine (TM) | 图灵机
- Decidable Language | 可判定语言
- Recursively Enumerable
- Undecidable
- P
- NP
- HALTING PROBLEM
- NP-complete
- Satisfiability (SAT)
- Mapping Reduction