Theory of Automata, Formal Languages, and Computation 

Course Number: CS 252

Course Description: 

Introduction to the classical and contemporary theory of computation covering regular,
context-free and computable (recursive) languages with finite slate machines, pushdown
automata and Turing machines. Basic concepts of computability theory, complexity theory, and NP-theory. 

Prerequisites: CS 212 Discrete Structures

Credit: 3 

Lecture Instructor: Julie A. Adams

Course Information:

Syllabus

Schedule

Example Simulations and Simulators

Turing Machines

• Visual Turing
• Turing Machine Simulator
• Turning Machine Simulator 2
• Nondeterministic Turing Machine Simulator

Finite Automata

• Finite Automata Simulator
• Automaton Simulator
• Visual Automata Simulator
• Nondeterministic Finite Automata Simulator
• Finite Automata Minimization Simulator
• Java Formal Languages & Automata Package - JFLAP

Grammars

• Grammar Tool Pâté

Pumping Lemma

• Regular Lang and CFL Pumping Lemma Tool

Push Down Automata

• PDA Simulator
• Non-Deterministic PDA simulator

Last Updated Dec 24, 2007 by adamsja.