Formal Definition of Finite Automata

We will now give all the necessary formal definitions we will later on use for the modeling of system behavior seen as the behavior of an automaton. We will start with an (ordinary) finite automaton (FA), deterministic as well as nondeterminist; then we will extend the ordinary finite automaton with output words (Mealy automaton) as well as with labels. Finally we will distinguish between finite automata accepting only finite or infinite input ($ \omega$-Automata, FA$ ^{\omega}$), which corresponds to the generation of finite or infinite output.



Subsections

Gerd Doeben-Henisch 2010-03-03