Formal Languages and Automata with Applications

1 credits · Undergraduate

An introduction to theoretical computer science including studies of abstract machines, the language hierarchy from regular sets to recursively enumerable sets, noncomputability, and complexity theory. Prerequisite: COMPSCI 201 and 230.