Article Per Year (5 Year)
p-Index From 2019 - 2024
0.23
P-Index
This Author published in this journals
All Journal STRING (Satuan Tulisan Riset dan Inovasi Teknologi)
Dimas Dandy Aryarajendra Suprapto
Unknown Affiliation
Computer Science & IT Mathematics

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Implementasi Finite State Automata pada Mesin Abstrak DFA dan NFA Berbasis Android Dimas Dandy Aryarajendra Suprapto; Fauziah Fauziah
STRING (Satuan Tulisan Riset dan Inovasi Teknologi) Vol 5, No 1 (2020)
Publisher : Universitas Indraprasta PGRI Jakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (8392.897 KB) | DOI: 10.30998/string.v5i1.6196

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.
Co-Authors Fauziah Fauziah