Csc520
Foundations of Computer Science
Syllabus
Class Notes
Other Notes
Introduction and Math Basics
Chomsky Hierarchy
Languages & Regular Languages
Deterministic Finite Automata
Nondeterministic Finite Automata
Regular Language/FA Equivalence
Non-regular languages
DFA Minimization
Context Free Languages
Parse Trees for CFLs
Grammar Constructions
Pushdown Automata for CFLs
Context Free/PDA Equivalence
Non-Context Free Languages
Turing Machines
TM computations
TM extensions
Universal TM / Halting Problem
TM Undecidable Problems
General Grammars
Grammar Undecidable Problems
Other Undecidable Problems
Textbook Problems
Textbook Solutions
JFLAP home
Regular Expressions
Regular Expressions
Regular Languages
Context Free Grammars
Turing Machines