MATH 620Automata Theory
Indiana State University · 3.000 credits · GRAD

Catalog
Study of the computational abilities of finite-state machines, including nondeterministic automata, transducers, weighted and probabilistic automata, pushdown automata, and Buchi automata. Topics may also include applications in machine learning and universal coalgebra. Recommended prerequisite knowledge: proof by induction on natural numbers, basic linear algebra.
Recent sections
Spring 2027 · 1 section
Jan 11 – May 7
| Section | Days & time | Location | Instructor |
|---|---|---|---|
| 301Class #12623 | Time not published | Web Site WEB | David Albert Sprunger |