The text covers important topics such as finite automata, regular expressions, push-down automata, grammars, and Turing machines via a series of problems of increasing difficultly. Problems are ...

Master the use of linear temporal logic and automata to define system requirements. Convert between regular expressions and non-deterministic finite automata (NFAs) for effective system requirements ...

Finite automata and regular languages. Stack Acceptors and Context-Free Languages. Turing Machines, recursive and recursively enumerable sets. Decidability. Complexity. This course involves no ...