closure properties of context-free languages of regular languages complement
of a language
of a set
complete systems complexity
space
time
complexity class NP
complexity class P
composition
computability
computable function computation
computational complexity concatenation
of languages
of strings
configuration of an automaton conjunctive normal form consistent systems
context-free grammars context-free languages context-sensitive grammars
context-sensitive languages control unit of an automaton Cook-Karp thesis
Cook's theorem
cycles in a graph CYK algorithm
D
dead configuration decidability
deciding a language DeMorgan's laws
dependency graphs derivation
leftmost
rightmost
derivation trees partial
yield
determinism
deterministic context-free languages deterministic finite accepters deterministic
pushdown automata, dfa
diagonalization disjoint sets
dpda