Automata theory is the study of abstract machines and automata, which are self-propelled computing devices that follow predetermined sequences of operations. These machines, such as finite-state machines, consist of states and transitions, and are used to represent formal languages. Automata theory is closely related to formal language theory and has applications in various fields including computation, compiler construction, artificial intelligence, parsing, and formal verification.
Carnegie Mellon University
Spring 2021
This advanced course reexamines traditional concepts of discrete mathematics (relations, functions, logic, graphs, algebra, automata) in the context of computation and algorithms, necessitating a strong background in discrete math.
No concepts data
+ 23 more concepts