CSIS 616 Automata Theory (3)

The theory of finite state machines and regular expressions are applied to the design of switching circuits, components of compilers such as lexical analysis, pattern-matching, text editors, unifications as needed in Prolog or for automated deduction, and almost any program which processes under commands. Undecidable problems and intractable problems are explored.
Prerequisite(s): Knowledge of discrete mathematics.
Course Frequency: Occasional
Citadel Course Number: CSCI 616