CL
DP
A
M
CT
Cal
Classify the computational complexity of a set of strings.
Learning Goal: Classify the computational complexity of a set of strings by determining whether it is regular, context-free, decidable, or undecidable.
PDF LaTeX Raw HTML
Learning Goal: Give examples of sets that are regular, context-free, decidable, or undecidable languages (and prove them).