Summary
Summary Theory of computation and automa theory
- Course
- Institution
This is a description of an automated theory course and its practical applications, including regular expressions, finite automata, and context-free grammars. An example of a finite automaton representing a game of tennis is provided. It also covers the concepts of languages, transition functions, ...
[Show more]