COMP 4270 Automata Theory

Analysis of automata concepts, finite automata and finite memory, transition tables, Meally and Moore models, strongly connected machines, reduced diagrams, component of state diagrams and infinite automata. Application of calculable functions by means of Turing. Discussion of the operation of programmable machines, programs, universal machines for a programmable computer and the Post System for the administration of symbols.

Credits

3

Prerequisite

COMP 2502