Deaf Machine Theory

Main Article Content

Ali Hameed Yassir


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

Article Details

How to Cite
Hameed Yassir, A. (2018). Deaf Machine Theory. Asian Journal of Research in Computer Science, 1(3), 1-2.
Original Research Article