Implementasi Finite State Automata pada Mesin Abstrak DFA dan NFA Berbasis Android

Dimas Dandy Aryarajendra Suprapto; Fauziah Fauziah

doi:10.30998/string.v5i1.6196

Implementasi Finite State Automata pada Mesin Abstrak DFA dan NFA Berbasis Android

Dimas Dandy Aryarajendra Suprapto^(1*), Fauziah Fauziah⁽²⁾

(1)
(2) Universitas Nasional
(*) Corresponding Author

Abstract

FSA abstract machine (Finite State Automata) is a machine that is only seen from logic and processes and can use various programming languages to make it. The FSA Abstract Engine is accepting and rejecting an input. FSA is divided into two namely, DFA (Deterministic Finite Automata) and NFA (Non-deterministic Finite Automata). This paper discusses the use of the FSA algorithm to create DFA and NFA abstract machines based on Android. By using an android-based FSA abstract engine application the user can determine the input results of the automata process accepted or rejected easily and accurately without having to do manual calculations.

Keywords

Abstract machine; FSA; DFA; NFA; Android

Full Text:

PDF

References

. R. A. Ma’arif and F. Fauziah, “Implementasi Finite State Automata (FSA) dalam Proses Pengisian Kartu Rencana Studi,” JOINTECS (Journal Inf. Technol. Comput. Sci., vol. 3, no. 3, pp. 255–260, 2018.

. Saputra, Tri Ichsan, dkk, “Simulasi Vending Machine Dengan Mengimplementasikan Finite State Automata,” vol. 3, no. 3, 2018.

. M. Y. F. Zaelani and Lelah, “Implementasi Finite State Automata Pada Aplikasi Pembelajaran Aksara Sunda,” vol. 8, no. 2, 2018.

. Leimena, Yessy Willy., Pakereng, Magdalena A. Ineke. (2017). Penerapan Finite Automata Pada Pergantian Desktop Background. Salatiga: Universitaas Kristen Satya Wacana.

. Mauboy, Raymond Elias. (2017). Penerapan Finite State Automata Pada Proses Peminjaman Buku di Perpustakaan Universitas Kristen Satya Wacana. Salatiga: Universitaas Kristen Satya Wacan

. Suparyanto, “Simulator Pengenal String Yang Diterima Sebuah Deterministic Finite Automata (DFA),” pp. 377–381, 2017.

. Widyasari, “Telaah Teoritis Finite State Automata Dengan Pengujian Hasil Pada Mesin Otomata,” Sisfotenika, vol. 1, no. 1, pp. 59–67, 2011.

. Sinurat, S. Simulasi Transformasi Regular Expression Terhadap Finite State Automata. Pelita Informatika: Informasi dan Informatika, vol. 4, no. 1, 2013.

DOI: http://dx.doi.org/10.30998/string.v5i1.6196