MCS 3320

Theory of Computing

Lec 01 selected

This course introduces automata theory, formal languages and computability. Topics include: finite automata; regular expressions; regular, context-free, and context-sensitive languages; computability models; algorithmic decidable and undecidable problems. Three lecture hours per week

Sections

Lecture

Lec 01

Mon, Wed, Fri 10:30-11:20

Mon, Wed, Fri10:30-11:20Faculty Sustainable Design Eng 128A47831

Syllabus

Have the syllabus for MCS 3320? Share it and everyone gets the grading, textbooks and rules.