|
Course
Description
Theory
of automata and learning machines. Finite-state sequential
machines and functions. Transition preserving functions, Generators
and minimal generating sets. Input semigroup, Isomorphisms
and Automorphisms.
Prerequisites
3
lecture hours
3 semester hours
|
