CS-C2160 - Theory of Computation, 12.01.2021-14.04.2021
This course space end date is set to 14.04.2021 Search Courses: CS-C2160
Lecture 7. The CYK parsing algorithm and Chomsky normal form, pushdown automata, limitations of context-free languages
Krav för slutförande
1. Parsing context-free grammars. The Chomsky normal form for CFGs.
2. The CYK parsing algorithm.
3. Pushdown automata. Pushdown automata and context-free languages.
4. A pumping lemma for context-free languages.