100% Plagiarism-Free
+1-727-416-5453

Sign In

Access your dashboard and order activity.

Forgot password?

Create Account

Register to place orders and track every step.

CS 373

Automata Theory & Formal Lg.

Binghamton University 4 credits CS

Course Description

Theory and application of automata and the languages they recognize. Regular languages, deterministic and non-deterministic finite automata, regular expressions, context-free languages, context-free grammars, pushdown automata, normal forms, context-sensitive languages, linear bounded automata, Turing recognizable languages, Turing decidable languages, Turing machines, computability, decidability, reducibility. Students utilize an automata simulator to program finite automata, pushdown automata, and Turing machines. Application of concepts. Prerequisites: CS 310 and either MATH 314 or MATH 330. All prerequisites must have a grade of C- or better. Offered every semester. 4 credits.

Code
CS 373
Credits
4
Subject
CS

Programs That Include This Course

Get expert help with CS 373 Automata Theory & Formal Lg.

Our subject experts help with essays, research papers, case studies, discussion posts, and capstone projects for these programs β€” written from scratch to your course requirements.

Get Help Now

Program and course information is reproduced from each university's published academic catalog for informational purposes and may change. Always confirm current requirements with your university. We are an independent academic support service and are not affiliated with or endorsed by the universities listed.

Academic Resources

Latest from the Blog

Expert guides on essay writing, citation styles, study skills, and academic success.

View All Articles