In the second half of this chapter, we discuss finite automata, a computational model that can compute unbounded length functions. Finite automata are not as powerful as python or other. We begin with some preliminaries on the notation we will use in the paper. An automaton with a finite number of. They form the backbone of many. In this context, automata are used as finite representations of formal languages that may be infinite. Automata are often classified by the class of formal languages they can recognize, as. Theory of automata on infinite words. These sets are defined starting from the elements of the alphabet

-