Finite Automa and Models of Computation
Download as PDF
Overview
Subject area
CSC
Catalog Number
I2100
Course Title
Finite Automa and Models of Computation
Department(s)
Description
Structure of finite state and combinational sequential machines. Partition and the substitution property. Homing and diagnosing experiments. Linear vs. non-linear machines. Deterministic vs. probabilistic machines. Impact on the design of efficient, reliable, and secure switching systems.
Academic Career
Graduate
Liberal Arts
No
Credits
Minimum Units
3
Maximum Units
3
Academic Progress Units
3
Repeat For Credit
No
Components
Name
Lecture
Hours
3
Requisites
019790