# Automata Theory

This course covers the theory of automata and languages. We begin with a study of finite automata and the languages they can define (the so-called "regular languages." Topics include deterministic and nondeterministic automata, regular expressions, and the equivalence of these language-defining mechanisms.

# Automata Theory

This course covers the theory of automata and languages. We begin with a study of finite automata and the languages they can define (the so-called "regular languages." Topics include deterministic and nondeterministic automata, regular expressions, and the equivalence of these language-defining mechanisms.

### There is one session available:

##### Automata Theory

### At a glance

- Institution: StanfordOnline
- Subject: Computer Science
- Level: Advanced
- Prerequisites:
The primary prerequisite for this course is reasonable "mathematical sophistication." That is, you should feel comfortable with mathematics and proofs. Specific topics that are useful include a knowledge of graphs, trees, and logic, as well as basic data structures and algorithms.

It is intended for students who have had at least 2 years of Computer-Science courses, including discrete mathematics (graphs, trees, logic, proofs, etc.) and an introduction to data structures and algorithms.

- Language: English
- Video Transcript: English