Formal languages; recursive functions; abstract complexity; automaton models; array machines; systolic systems; cellular automata. Antirequisite(s): Prerequisite(s): Computer Science 3331A/B or permission of the Department. Corequisite(s): Pre-or Corequisite(s): Extra Information: 3 lecture hours, 0.5 course. back to top
