Finite Automata Models

Abstract

This chapter provides an introduction to the theory of finite automata, including deterministic and nondeterministic models. We discuss state transition functions, valid sequences of inputs, and languages generated by automata, as well as compositions of automata. The chapter also introduces different observation models, i.e., automata with outputs, such as Moore automata and labeled automata, and establishes the notation used when developing state estimation and event inference algorithms in the remainder of the book.