Introduction to Automata and Computability
Download as PDF
Overview
Subject area
CS
Catalog Number
457
Course Title
Introduction to Automata and Computability
Department(s)
Description
Alphabets, languages, deterministic and nondeterministic finite automata, regularexpressions, language acceptors, grammars, Turing machines and computability.
Typically Offered
Fall, Spring
Academic Career
Undergraduate
Liberal Arts
Yes
Credits
Minimum Units
4
Maximum Units
4
Academic Progress Units
4
Repeat For Credit
No
Components
Name
Lecture
Hours
4
Requisites
014832