CS403: Introduction to Formal Languages & Automata Theory
UAH CS403: finite automata, regular expressions, grammars, pushdown automata, Turing machines, and the halting problem, built up one model at a time on paper.
#computability
Content tagged with "computability"
CS603: Formal Languages & Automata Theory
UAH CS603, graduate formal languages and automata: DFAs, NFAs, regular languages, grammars, pushdown and linear-bounded automata, decidability.