ABSTRACT
Finite automata are well-known tools of language theory. Every finite state automaton accepts or recognizes a certain language. Before a formal defi nition, let’s take a look at the following example of Australian public paytelephone illustrated as a finite state automaton.
