| |
May 08, 2024
|
|
|
|
|
EE 7123 - Automata Theory
Fundamental concepts of abstract algebra/finite state automata/Galois fields, sequential machines, decomposition of sequential machines, measurement/control and identification of sequential machines, regular expressions and machine specification, vector spaces/linear transforms and matrices, linear sequential machines, Turing machines, artificial languages, random sequences, random processes in sequential machines, support vector machines, NN’s, hierarchical spatio-temporal memories, syntactic/structural pattern recognition, biological computing.
Requisites: EE 5143
Credit Hours: 3
Repeat/Retake Information: May not be retaken.
Lecture/Lab Hours: 3.0 lecture
Grades: Eligible Grades: A-F,WP,WF,WN,FN,AU,I
Learning Outcomes:
- Understanding of the finite state automata and theory of computation.
- Ability to use the mathematics (vector spaces, linear transforms, etc.) to solve problems in automata.
Add to Portfolio (opens a new window)
|
|
