Transcript Document 7871325

National University of Ireland, Maynooth
Department of Computer Science
CS355 – Theory of
Computation
Dr. Aidan Mooney, September 2006
Relevant courses
•
•
•
•
Models of computation
Discrete structures / Logic
Data structures and algorithms
Computational complexity theory
Dr. A. Mooney, Dept. of Computer Science, NUI Maynooth
Course requirements
• Data structures and algorithms
• 1st year undergraduate mathematics
Dr. A. Mooney, Dept. of Computer Science, NUI Maynooth
Course overview
• Language theory
• Three “simple” machines (finite automata,
pushdown automata, Turing machines)
Dr. A. Mooney, Dept. of Computer Science, NUI Maynooth
Course detail 1/2
• Mathematical preliminaries
• Regular languages, finite automata, and regular
expressions
• Nondeterminism and determinism in finite
automata
• Properties of regular languages
• Nonregular languages
• Context-free languages, context-free grammars,
and pushdown automata
Dr. A. Mooney, Dept. of Computer Science, NUI Maynooth
Course detail 2/2
• Nondeterminism and determinism in pushdown
automata
• Properties of context-free languages
• Non-context-free languages
• Multi-stack machines
• Recursively-enumerable languages and Turing
machines
• Recursive and nonrecursive languages
• Reductions.
Dr. A. Mooney, Dept. of Computer Science, NUI Maynooth
Course Details
• Course Text:
– Michael Sipser, “Introduction to the Theory of
Computation”, Second Edition (ISBN:
0619217642).
Dr. A. Mooney, Dept. of Computer Science, NUI Maynooth
Course Details
• Contact: [email protected]
• Office: 2.105 Callan Building
• Lectures:
– Monday 1-2 JH6
– Tuesday 5-6 Callan Hall
• Laboratories:
– To be decided
• 3rd and 4th Year Science, CSSE, Bioinformatics
Students.
• 70% Final Examination, 30% Continuous
Assessment.
Dr. A. Mooney, Dept. of Computer Science, NUI Maynooth