Deaf Machine Theory
Asian Journal of Research in Computer Science · pp. 1–2 · Published 10 Aug 2018
10.9734/ajrcos/2018/v1i324744Abstract
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.
Cited by 0
No indexed citations yet.
Related research
- Introduction to a New MDPI Open Access Journal: Organics — shares topic coverage
- On the Question of Zwitterionic Intermediates in the [3+2] Cycloaddition Reactions: A Critical Review — shares topic coverage
- A Review of the Synthetic Strategies toward Dihydropyrrolo[1,2-a]Pyrazinones — shares topic coverage
- Acknowledgment to the Reviewers of Organics in 2022 — shares topic coverage
- Parallel Synthesis of Aurones Using a Homogeneous Scavenger — shares topic coverage
Article metrics
Real usage data collected on this platform.
0
Page views
0
PDF downloads
0
Outbound clicks
0
Citations
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
No views recorded yet.
Traffic sources
Referring site, by host.
No traffic recorded yet.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.