CSc I2100 Finite Automata and Models of Computation
A review of the basic definitions, concepts and results concerning finite automata (e.g. Myhill-Nerode Theorem). Applications of finite state automata in the modeling of circuits for fast arithmetic computation, exploring graphs and robotic computations, pseudorandom number generators for internet protocols, recent physical and biological applications (e.g. Watson-Crick finite automata).
Contact Hours
3 hr./wk.