Asian Journal of Research in Computer Science, .,Vol.: 1, Issue.: 3
Deaf Machine Theory
Ali Hameed Yassir1* 1College of Computer Science and Information Technology, Sumer University, Thiqar, Iraq.
Ali Hameed Yassir1*
1College of Computer Science and Information Technology, Sumer University, Thiqar, Iraq.
(1) M. Ilayaraja, Assistant Professor, Department of Computer Science and Information Technology, Kalasalingam University, Krishnankoil, India.
(2) G. Sudheer, Professor, Deptartment of Mathematics and Computer Science, GVP College of Engineering for Women, Madhurawada, India.
(1) E. N. Ganesh, ECE School of Engineering, VISTAS, India.
(2) T. Marimuthu, Ayya Nadar Janaki Ammal College, India.
(3) S. Saravanan, Jansons Institute of Technology, India.
(4) M. K. Marichelvam, Mepco Schlenk Engineering College, India.
Complete Peer review History: http://www.sciencedomain.org/review-history/25831
In this paper, the author presents an abstract model of a computable machine that is passive to inputs. The model is conceptually a deaf machine that is basically an automaton that does not have any acceptance state. The Deaf machine may have one or more normal states and can even have infinite states (uncountable normal states). The Machine can not recognize any language either formal informal. The Proposed model is a finite state machine without the accept state and cannot recognize any language.
Theory of computation; computer science; deaf machine; automata; FSM.
Full Article - PDF Page 1-2Review History Comments