BLG 311 - Formal Languages and Automata Theory

Course Objectives

Formal languages. Grammars. Regular expressions. Finite state machines: Mealy and Moore models. State reduction. Determinist and non determinist finite automata. Push down automata and context-free grammar. Turing machine and computability.

Course Description

Formal languages. Grammars. Regular expressions. Finite state machines: Mealy and Moore models. State reduction. Determinist and non determinist finite automata. Push down automata and context-free grammar. Turing machine and computability.