Theoretical Computer Science
A list by volgin · 43 items
- Propositional logic
- Set theory
- Cartesian product
- Mathematical proof
- Function (mathematics)
- Relation (mathematics)
- Formal language
- Big O notation
- Regular language
- Formal grammar
- Chomsky hierarchy
- Finite-state machine
- Regular expression
- Pumping lemma
- Pumping lemma for regular languages
- DFA minimization
- Context-free language
- Pushdown automaton
- CYK algorithm
- Pumping lemma for context-free languages
- Computability theory
- Turing machine
- Computability
- Computable set
- Gödel numbering
- Recursive language
- Recursively enumerable language
- Post correspondence problem
- Computational complexity theory
- Nondeterministic algorithm
- Zero-knowledge proof
- P versus NP problem
- Myhill–Nerode theorem
- Greibach normal form
- Cook–Levin theorem
- Complexity class
- Gap theorem
- Blum's speedup theorem
- Miller–Rabin primality test
- Carmichael number
- AKS primality test
- Mathematical induction
- Horner's method
No comments yet
Sign in to comment.