CS 3350

Automata/Computabi/Formal Lang

University of Texas at El Paso · UGRD · Fall 2026

1 section

Catalog description

Automata, Computability and Formal Languages (3-0) Theoretical computing models and the formal languages they characterize: finite state machines, regular expressions, pushdown automata, context-free grammars, Turing machines and computability. Capabilities and limitations of each model, and applications including lexical analysis and parsing. Restricted to majors: CS, EECE Prerequisite: ( CS 2302 AND MATH 2300 ) OR ( CS 2401 AND MATH 2300 ).

Sections

Current meeting, instructor, credit, and enrollment details

Updated 5 hours ago

001

Availability not recently verified

Class #texas_el_paso-1144Fall 2026UGRD

Days & times: No scheduled meeting time
Meeting dates: —
Location: —
Instructor: Staff

Class numbers and section codes come from the registrar.

Spot missing or incorrect course data?