Deutsch Pусский العربية فارسی Türkçe
Skip To Content Site Search Deutsch Pусский العربية فارسی Türkçe
Eastern Mediterranean University

Automata Theory (CMPE471)

Mathematical preliminaries and basic concepts. Strings, Languages and Grammars. Chomsky hierarchy of grammars. Deterministic and nondeterministic finite automata. Equivalence of deterministic and nondeterministic finite automata. Minimization of finite automata. Regular grammars and regular expressions. Pushdown automata. Context free grammars. Chomsky normal form. Greibach normal form. Correspondence of pushdown automata and context free grammars. Introduction to Parsing

Credit: 4

Lecture Hour (hrs/week): 4

Lab (hrs/week): 2

Tutorial (hrs/week): 1

Related Programs