Constructive formal conversion of Moore machine to deterministic finite automata
Shagufta Riaz, Nazir Ahmad Zafar · International Conference on Mathematical methods, Computational techniques and Intelligent systems · 2008
The complexity of a system in terms of its state space and functional aspects enforces to choose most prolific and rigorous approaches to sustain the development of the software systems. Finite automaton is a formal and natural medium to describe the static and dynamic behavior of a complex system. Z notation is an ideal specification language having inherent capability to describe state space of a system and then defining operations over it. This paper deals with the integration of finite automata and Z which can enhance the modeling power for a complex system. Although Moore machine cannot be used for language recognition but its conversion into deterministic finite automata makes it possible to pretend as a language recognizer. Here a formal conversion of Moore machine to deterministic finite automata based on a string as well as a language is proposed using Z. Formal specification of the linkage between Z and automata is analyzed and validated using Z/EVES tool.