CSC473
Download as PDF
CSC473 - 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)
Enrollment Requirements
017109
Name
Discussion
Workload Hours
0
Optional Component
Yes
Name
Lecture
Workload Hours
3
Optional Component
No
Typically Offered Main Campus
Spring
Typically Offered Distance Campus
Not Offered
Typically Offered UA Online Campus
Not Offered
Typically Offered Phoenix Campus
Not Offered
Typically Offered South Campus
Not Offered
Typically Offered Community Campus
Not Offered