Description
Finite automata and regular expressions, properties of regular sets, context-free grammars, pushdown automata, deterministic context-free languages. Turing machines, the Chomsky hierarchy. Undecidability, intractable problems.
Prerequisites
- Prerequisite(s): MATH 3106 or MATH 3158 or MATH 3855 or permission of the School.
Conditions and arrangements
- Also listed as COMP 4805 .
- Prerequisite(s): MATH 3106 or MATH 3158 or MATH 3855 or permission of the School.
- Also offered at the graduate level, with different requirements, as MATH 5605 , for which additional credit is precluded.
- Lectures three hours a week.
Reference text in its original language
Finite automata and regular expressions, properties of regular sets, context-free grammars, pushdown automata, deterministic context-free languages. Turing machines, the Chomsky hierarchy. Undecidability, intractable problems.
- Prerequisite(s): MATH 3106 or MATH 3158 or MATH 3855 or permission of the School.
- Also listed as COMP 4805 .
- Also offered at the graduate level, with different requirements, as MATH 5605 , for which additional credit is precluded.
- Lectures three hours a week.
Sources and references
Dates and sources are retained to help you verify the information. Translations are provided to facilitate reading; the official source governs conditions and requirements.
Source reference : https://calendar.carleton.ca/undergrad/courses/MATH/