Languages as sets of strings over an alphabet; operations on languages; finite automata, regular expressions; language hierarchy; Turing machines; models of computation. Antirequisite(s): Prerequisite(s): Computer Science 2214A/B or Mathematics 2155A/B or permission of the department. Corequisite(s): Pre-or Corequisite(s): Extra Information: 3 lecture hours, 0.5 course. back to top
