COM SCI 284P
Topics in Automata and Languages
Computer Science · 4 units · Graduate courses (200-299)
Additional requisites for each offering announced in advance by department. Selections from families of formal languages, grammars, machines, operators; pushdown automata, context-free languages and their generalizations, parsing; multidimensional grammars, developmental systems; machine-based complexity. Subtitles of some current and planned sections: Context-Free Languages (284A), Parsing Algorithms (284P). May be repeated for credit with consent of instructor and topic change.
Letter grading.
Requisites
Official UCLA wording
Requisite: course 181.
BruinTree reads · Prerequisite
confidence 1.00 · from textRequires
Everything that has to come before this course, not just the courses named in the requisite above.
COM SCI 284P
- COM SCI 181Theory of Computing
- COM SCI 180Introduction to Algorithms and Complexity
1 direct requisite. Showing 4 courses over 3 levels; the branches marked with a count carry on past it. Every course here opens its own tree.
Unlocks
What this course is a requisite for, and what those courses lead to in turn.
No course in the catalog lists this as a requisite.