CS 601 - Mathematical Theory of Formal Languages - 3 credit hours
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.
Home | Colloquia | Research | People
Current Students | Prospective Students | Companies | Visitors
Scholarships | Courses | Degrees | PIBBS
Computer Facilities | Jobs | Links
Contact Info:
(505) 277-3112 (phone)
(505) 277-6927 (fax)
Web site questions:
All other questions:
(505) 277-3112 (phone)
(505) 277-6927 (fax)
Web site questions:
All other questions:
University of New Mexico
Department of Computer Science
Mail stop: MSC01 1130
1 University of New Mexico
Albuquerque, NM 87131-0001
Department of Computer Science
Mail stop: MSC01 1130
1 University of New Mexico
Albuquerque, NM 87131-0001
