This course will discuss theories of language that extend beyond the power of context-free languages, such as tree adjoining
grammar, combinatory categorial grammar, linear context-free rewriting systems, as well as their synchronous counterparts, and
tree transformation automata. We will focus on complexity results for recognition and probabilistic decision problems for these
various frameworks.
| CRN | Course | Course Title | Term | Credits | Status | ||||
| 77291 | CSC 571 | LANG PARSING & COMPLXTY | Fall 2012 | 2.0 | Open | ||||
| Schedule: | Day | Begin | End | Building | Room | ||||
| TR | 1525 | 1640 | CSB | 632 | |||||
| Enrollment: | Sec Enroll | Sec Cap | Updated | ||||||
| 5 | 999 | 05/31/2012 | |||||||