The Chomsky hierarchy of languages and its relationship to automata needed as acceptors. Undecidability, including extended Rice's Theorem, the Post correspondence problem and undecidable questions regarding CFLs. Abstract families of languages and closure properties.
Prerequisite: 500.
News & Events | People | Academics | Research | Jobs | Companies | Visitors | Computer Facilities | Home
