← Go Back

CMSC 141 - Automata and Languages Theory

Course Description

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Vestibulum suscipit risus lectus, sit amet aliquet sapien lobortis fermentum. Integer in

Course Learning Outcomes

After completion of the course, the student should be able to:

1. Lorem ipsum dolor sit amet, consectetur adipiscing elit. Vestibulum suscipit risus lectus, sit amet aliquet sapien lobortis fermentum. Integer in
2. Lorem ipsum dolor sit amet, consectetur adipiscing elit. Vestibulum suscipit risus lectus, sit amet aliquet sapien lobortis fermentum. Integer in
3. Lorem ipsum dolor sit amet, consectetur adipiscing elit. Vestibulum suscipit risus lectus, sit amet aliquet sapien lobortis fermentum. Integer in
4. Lorem ipsum dolor sit amet, consectetur adipiscing elit. Vestibulum suscipit risus lectus, sit amet aliquet sapien lobortis fermentum. Integer in; and
5. Lorem ipsum dolor sit amet, consectetur adipiscing elit. Vestibulum suscipit risus lectus, sit amet aliquet sapien lobortis fermentum. Integer in

Course Outline

UNIT 1. Finite Automata

1. Introduction to Automata
2. Deterministic Finite Automata
3. Regular Languages
4. Nondeterministic Finite Automata
5. Equivalence of Finite Automata and Regular Expressions
6. Finite Automata Extensions
7. Properties of Regular Languages
8. Pumping Lemma for Regular Languages

UNIT 2. Context-Free Languages

1. Context-Free Grammars
2. Parse Trees
3. Simplification and Normal Forms of CFG
4. Pushdown Automata
5. Equivalence of PDA & CFG
6. Properties of Context-Free Languages

UNIT 3. Turing Machines

1. Turing Machines
2. Recursively Enumerable Languages
3. Turing machine extensions
4. Undecidability & Intractability
5. P vs. NP