CSCI 4325 · Fall 2026

Automata, Formal Languages, and Computation

Course information

Section / CRN
CSCI 4325.03 · 40296
Class meetings
Monday & Wednesday, 12:30–1:45 p.m.
Classroom
EIEAB 2.207
Final exam
Wednesday, December 9, 10:15 a.m.–noon
EIEAB 2.207

View syllabus

Instructor & office hours

Instructor
Austin Luchsinger
Email
austin.luchsinger@utrgv.edu
Office
EIEAB 3.246
Office hours
Tuesday & Thursday
9–11 a.m. and 2–4 p.m.

What can a computer compute?

Explore the mathematical foundations of computation, from finite automata and formal languages to Turing machines, computability, and complexity.

Textbook: Introduction to the Theory of Computation, Michael Sipser, 3rd edition.

Schedule & topics

Topics include finite-state machines, pushdown automata, formal grammars, Turing machines, the halting problem, and computational complexity.

Fall 2026 · Monday & Wednesday
WeekMondayWednesday
8/24 – 8/26No classIntro
8/31 – 9/23310 Review / DFADFA Quiz
9/7 – 9/9Labor DayDFA
9/14 – 9/16DFA/NFADFA/NFA Exam
9/21 – 9/23PDAPDA Quiz
9/28 – 9/30PDAPDA Exam
10/5 – 10/7Turing MachinesTM Quiz
10/12 – 10/14Turing MachinesTM Exam
10/19 – 10/21TBDTBD
10/26 – 10/28DecidabilityDecidability Quiz
11/2 – 11/4DecidabilityDecidability Exam
11/9 – 11/11Complexity 1 (membership)Complexity 1 Quiz
11/16 – 11/18Complexity 1 (membership)Complexity 1 Exam
11/23 – 11/25Complexity 2 (hardness)Complexity 2 Quiz
11/30 – 12/2Complexity 2 (hardness)Complexity 2 Exam
12/7 – 12/9No classFinal

Review & extra credit

Resources

Additional resources, courtesy of Dr. Wylie.

How to Prove It: A Structured Approach, Daniel Velleman, 2nd edition, 2006.

View all semesters for CSCI 4325