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
Related Programs
- Software Engineering Undergraduate Program
- Information Systems Engineering Undergraduate Program
- Computer Engineering Undergraduate Program
- Computer Engineering Master's Program (with Thesis)
- Computer Engineering Doctoral Program
- Software Engineering - Computer Engineering Double Major Program
- Computer Engineering - Software Engineering Double Major Program
- Computer Engineering - Information System Engineering Double Major Program
- Information System Engineering - Computer Engineering Double Major Program
- Information Systems Engineering - Electrical and Electronic Engineering Double Major Program
- Software Engineering Master's Program (with Thesis)