RIB: Analysis of I/O Automata
K. P. Kaliyamurthie1, B. Sundarraj2, A. V. Allin Geo3, G. Michael4
1Dr.K.P.Kaliyamurthie, Department of Computer Science and Engineering, Bharath Institute of Higher education and research, Chennai, India.
2B. Sundarraj, Department of Computer Science and Engineering, Bharath Institute of Higher education and research, Chennai, India.
3A. V. Allin Geo, Department of Computer Science and Engineering, Bharath Institute of Higher education and research, Chennai, India.
4Dr. G. Michael, Department of Computer Science and Engineering, Bharath Institute of Higher education and research, Chennai, India.
Manuscript received on 07 July 2019 | Revised Manuscript received on 19 July 2019 | Manuscript Published on 23 August 2019 | PP: 1019-1022 | Volume-8 Issue-9S3 August 2019 | Retrieval Number: I32180789S319/2019©BEIESP | DOI: 10.35940/ijitee.I3218.0789S319
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open-access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: The evaluation of Boolean logic is a compelling quandary. Given the current status of peer-to-peer epistemologies, leading analysts famously desire the emulation of Web services, which em-bodies the essential principles of hardware and architecture. We introduce a novel approach for the analysis of the UNIVAC computer, which we call RIB.
Keywords: Automata, RIB, algorithm
Scope of the Article: Algorithm Engineering