CSCV473
Download as PDF
CSCV473 - Automata, Grammars and Languages
Course Description
Introduction to models of computation (finite automata, pushdown automata, Turing machines), representations of languages (regular expressions, context-free grammars), and the basic hierarchy of languages (regular, context-free, decidable, and undecidable languages).
Min Units
3
Max Units
3
Repeatable for Credit
No
Grading Basis
GRD - Regular Grades A, B, C, D, E
Career
Undergraduate
Course Attributes
WE - WEC (Writing Emphasis Course)
May be convened with
Component
Lecture
Optional Component
No
Typically Offered Distance Campus
Spring (even years only)
Typically Offered Sierra Vista Campus
Spring (even years only)