No Detail Found!

Constructive formal conversion of moore machine to deterministic finite automata.

Author(s)
Shagufta Riaz Faculty of Information Technology, University of Central Punjab, Lahore, Pakistan
Nazir Ahmad Zafar Department of Computer and Information Sciences, Pakistan Institute of Engineering and Applied Sciences, Nilore, Islamabad, Pakistan
Abstract
Automata theory is a study of abstract computing machines, useful for system modeling, and the analysis of algorithms used by such machines. Z notation is an ideal specification language which can be used for describing state space of a system and then defining operations over it. The integration of finite automata and Z can enhance modeling power for complex systems. This paper describes behavior of deterministic finite automata and Moore machine using Z notation. Then a formal conversion of Moore machine to deterministic finite automata, showing a close relationship between them, is proposed. Formal specification of the linkage between Z and automata is analyzed and validated using Z/EVES tool.
Publication Details
Page(s) 39-44
DOI DOI not available
Published Journal: Proceedings of International Conference on Information Communication Technologies, Volume: 27, Issue: 0, Year: 2008

Request the full text from PASTIC

0

Citations

0

Downloads

109

Views