Basic Information
Phrase Structure Grammars, The Chomsky Hierarchy of Languages, Type O Grammars and Turing Machines, Context-sensitive Languages And Linearly Bounded Automata, Context Free Languages, Characterizations, Homomorphism Theorems and Subfamilies, Push-down Automata - Various Models, Stack Automata. Operations On Languages, Decision Problems, Time and Tape Bounded Turing Machines, Complexity Hierarchies of Languages, Time and Space Bounds For Recognizing Families of Languages, Complexity of Problems In Formal Languages.
Faculty: Computer Science
|Graduate Studies
Pre-required courses
(234129 - Int. to Set Theory and Automata For Cs and 236343 - Theory of Computation) or (236343 - Theory of Computation and 236353 - Automata and Formal Languages)