Search Results

CSĀ 550. Automata and Formal Language Theory. 3 Hours.

Finite-state automata and regular expressions, context-free grammars and pushdown automata, turing machines, computability and decidability, and complexity classes.