Implementasi Transisi Finite State Automata dengan Aplikasi Mesin Abstrak DFA dan NFA berbasis Android
Keywords:Finite State Automata, Abstract Machines, DFA, NFA, Android Studio, Automata
Language and automata are important sciences that make them the main components in making software. If one of them does not have these components, there will be an imbalance or even fail to make a software. Because language is a tool used daily in communicating both to humans and computers. While automata is a process that can operate alone, by having a theory about abstract machines and is closely related to language. Automata has a relationship in the form of grammar, where the grammar is an abstract form that can reject if the input string we entered is wrong and accept if the input string we entered is correct to generate an output that matches the input. The purpose of this study is to test the theories of Language and Automata to be verified by making DFA and NFA abstract machine applications using Android Studio. The results shown by the Abstract Machine application that have been made are able to read and process numbers with an integer range of 2,147,483,647 and also the level of accuracy of reading data in each state process is 90.00% or 36 data that were successfully tested without experiencing errors from 40 data that have been tested on application.
Widyasari, “Telaah Teoritis Finite State Automata Dengan Pengujian Hasil Pada Mesin Otomata,” Sisfotenika, vol. 1, no. 1, pp. 59–67, 2011, [Online]. Available: https://media.neliti.com/media/publications/.
A. H. Pratomo, O. S. Simanjuntak, and D. C. N. Putra, “Bisindo Sign Language Transliteration Using Automata,” Compiler, vol. 8, no. 1, p. 57, 2019, doi: 10.28989/compiler.v8i1.415.
T. H. Wicaksono, F. D. Amrizal, and H. A. Mumtahana, “Pemodelan Vending Machine dengan Metode FSA ( Finite State Automata ),” DoubleClick J. Comput. Inf. Technol., vol. 2, no. 2, pp. 66–69, 2019, [Online]. Available: http://e-journal.unipma.ac.id/index.php/doubleclick.
V. Atina, S. Palgunadi, and W. Widiarto, “Program Transliterasi Antara Aksara Latin dan Aksara Jawa dengan Metode FSA,” J. Teknol. Inf. ITSmart, vol. 1, no. 2, p. 60, 2016, doi: 10.20961/its.v1i2.592.
D. Suhaedi, “EKSPRESI REGULAR PADA SUATU DETERMINISTIC FINITE STATE AUTOMATA,” J. Mat., vol. 6, no. 1, pp. 63–70, 2006.
B. Richardson, K. Hendy, V. Andiyani, and W. Philips, “Penerapan Konsep Non-Deterministic Finite Automata (NFA) pada Aplikasi Simulasi Mesin Kopi Vending,” J. Inform. Univ. Pamulang, vol. 4, no. 1, p. 1, 2019, doi: 10.32493/informatika.v4i1.2062.
How to Cite
Copyright (c) 2021 Infoman's : Jurnal Ilmu-ilmu Manajemen dan Informatika
This work is licensed under a Creative Commons Attribution 4.0 International License.