CS 302 Formal Languages and Automata Theory Select Term:
Introduction to languages, grammars and computation, Chomsky hierarchy, Regular languages and regular expressions, finite state automata and nondeterminism, automata determinization and minimization, pumping lemma and closure properties for regular languages, context free languages and grammars, push-down automata, pumping lemma for context-free languages, closure properties of context-free languages.
SU Credits : 3.000
ECTS Credit : 6.000
Prerequisite : -
Corequisite :
CS 302R