Search Results
CSC 707 Automata, Languages and Computability Theory
颁厂颁听707听听Automata, Languages and Computability Theory听听(3 credit hours)听听
Formal models of language and computation; finite automata and regular languages, pushdown automata and context-free languages, Turing machines. Relative power of models, Chomsky hierarchy. Inherent complexity of problems: undecidability, computational complexity, intractable problems.
Typically offered in Fall only