Computer Science Master's Exam Syllabus
for
MCS 441 - Theory of Computation I.
 
Course Description:   strings, languages, operations on languages

Detailed Description:  

  • regular languages:

      DFA, NFA, regular expressions, and their
      equivalence
      closure properties
      pumping lemma and applications

  • context free languages:

      context free grammars, PDA, and their
      equivalence
      closure properties
      Chomsky normal form
      pumping lemma and applications

  • Turing machines:

      definition, variants: multitape,
      nondeterministic
      Turing recognizability and decidability
      decision problems for automata and grammars
(Revised by Professor G. Turan (gyt@uic.edu), 4/23/01 from the department catalog description with details for CS Master's Exam Syllabus)
 
Credit:   3 Hours.
Prerequisites:   Grade of C or better in MCS 261.
Instructors/Teaching Assistants?

Not all courses will necessarily be offered each term. For the latest official information, please consult the UIC Timetable for a listing of courses offered this term.
This listing is for informational purposes only and does not constitute a contract. Every attempt is made to provide the most current and correct information. Courses listed here are subject to change without advance notice. Courses are not necessarily offered every term or year. Individual departments or units should be consulted for information regarding frequency of course offerings.
Return to MCS Homepage or Return to MSCS Homepage -- Updated April 30, 2001