Read our cookies policy and privacy statement for more information.
×Sacramento, California
Introduction to computing theory with examples and applications. Automata and formal languages; regular expressions; deterministic and non-deterministic finite automata; pumping lemma for regular languages; push-down automata and context-free grammars; language recognition; parsing techniques including recursive descent; Turing machines; computable and non-computable functions. Design and implementation of selected features of programming languages. Functional and logic programming paradigms.
Units: 3.0