Glossary

c | d | f | i | n | p | r | u

c

church-turing {Learning outcome}

classify decision problem {Learning outcome}

classify language {Learning outcome}

complexity {Application}

context-free grammars {Learning outcome}

context-free languages {Application}

d

decidable languages {Application}

define decision problem {Learning outcome}

diagonalization {Learning outcome}

f

find example languages {Learning outcome}

formal definition of automata {Learning outcome}

i

informal definition of automata {Learning outcome}

n

nondeterminism {Learning outcome}

p

pumping lemma {Learning outcome}

r

reduction {Learning outcome}

regular expressions {Learning outcome}

regular languages {Application}

u

undecidable languages {Application}