CSCI 119 - Introduction to Finite Automata

Prerequisite: CSCI 41, CSCI 60
Strings, languages, and fundamental proof techniques. Regular expression, regular grammar, regular languages, finite automata, their interrelationship, and their properties. Introduction to context-free languages.

Weekly Lecture Hours: 3
Weekly Lab/Activity Hours: 2
Units: 4

Course Typically Offered: Fall, Spring