Introduction to Automata and Computability

CS457 (Liberal Arts) Introduction to Automata and Computability 4 hrs. 4 crs. Propositional logic, graphs and digraphs, alphabets, languages, deterministic and nondeterministic finite automata, regular expressions, languages acceptors, grammars, Turing machines and computability. Preq: CS 291

Document Actions