COMP 454 - Automata, Lang & Comput

Show Details for Open Courses Only

Description

Hours: Three hours lecture in the lab per week Prerequisites: MATH 300 Study of the relation of languages (i.e. sets of strings) and machines for processing these languages, with emphasis on classes of languages and corresponding classes of machines. Phrase structure languages and grammar. Types of grammars and classes of languages. Regular languages and finite state automata. Context-free languages and pushdown automata. Unrestricted languages and Turing Machines. Computability models of Turing, Church, Markov, and McCarthy. Applications to programming languages, compiler design, and program design and testing.

Units: 3.00
Grading: Letter Grade

Info has been updated in the last 30 minutes
Session Section Class # Type Days Time Location Instructor Course Details [Key]
1 01 1985 LEC ARR Online Michael Soltys Course Closed Class Details
1 01 W  7:00 PM  -  8:00 PM  Online Michael Soltys Course Closed Class Details

Key for Course Detail Icons

  • Course open= Course Open
  • course closed= Course Closed
  • course details= Course Details
  • textbook info= Textbook Info
  • General Education Class= General Education
  • Extended University Class= Extended University
  • Service Learning Class= Service-Learning
  • In Person Course= In Person Course
  • Asynchronous Online Course= Asynchronous Online Course
  • Synchronous Online Course= Synchronous Online Course
  • Synchronous/Asynchronous Course= Synchronous/Asynchronous Course
  • No Cost Course Materials= No Cost Course Materials
  • Low Cost Course Materials= Low Cost Course Materials