-
Institution:
-
University of California-Riverside
-
Subject:
-
-
Description:
-
Lecture, 3 hours; discussion, 1 hour. Prerequisite(s): CS 014; CS 111/MATH 111; MATH 009C or MATH 09HC. A study of formal languages, including regular and context-free languages; computational models for generating these languages such as finite-state automata, pushdown automata, regular expressions, and context-free grammars; mathematical properties of the languages and models; equivalence between the models, and an introduction to Turing machines and decidability.
-
Credits:
-
4.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(951) 827-1012
-
Regional Accreditation:
-
Western Association of Schools and Colleges
-
Calendar System:
-
Quarter
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2025 AcademyOne, Inc.