User:Nviladkar/Books/TOC

Languages and Grammars

 * Regular
 * Kleene star
 * Regular expression
 * Prefix grammar
 * Regular language
 * Regular grammar
 * Linear grammar
 * Deterministic finite automaton
 * Nondeterministic finite automaton
 * Moore machine
 * Mealy machine
 * Pumping lemma for regular languages


 * Context Free
 * Context-free grammar
 * Dependency grammar
 * Pushdown automaton
 * Deterministic pushdown automaton
 * Context-free language
 * Pumping lemma for context-free languages
 * Attribute grammar
 * CYK algorithm


 * Context Sensitive
 * Context-sensitive grammar
 * Context-sensitive language
 * Turing machine
 * Linear bounded automaton
 * Non-deterministic Turing machine
 * Universal Turing machine
 * Turing completeness
 * Turing degree
 * Recognizable language
 * Recursively enumerable language
 * Recursive language
 * Chomsky normal form


 * Normal Forms
 * Chomsky hierarchy
 * Backus–Naur Form

Decision Problems and Complexity

 * Decision problem
 * Undecidable problem
 * PCP
 * SAT
 * List of undecidable problems
 * Complete (complexity)
 * Reduction (complexity)
 * Time complexity
 * NP (complexity)
 * Co-NP
 * NP-hard
 * NP-complete
 * Co-NP-complete
 * Halting problem
 * P versus NP problem
 * List of NP-complete problems
 * PSPACE-complete
 * EXPTIME
 * Polynomial hierarchy
 * Space hierarchy theorem
 * List of PSPACE-complete problems