Finite Automata as Discrete Dynamic Systems
Finite Automata as Discrete Dynamic Systems

Summary/Abstract: In this paper after briefly considering the history of the concept of Finite Automata we return to its original understanding (as introduced by Moore and Mealy) and consider Finite Automata in the general framework of Discrete Dynamic Systems. In this general framework we can define the concept of equivalence of automata as a real equivalence relation. We show that there are more then just two types (Moore and Mealy) of Finite Automata. We find that Finite Automata of different types can be considered as solutions of some Discrete Dynamic Systems. We answer the question of “What type automata we obtain connecting Moore and Mealy type of automata”.

• Details
• Contents