STRING (Satuan Tulisan Riset dan Inovasi Teknologi)
Vol 5, No 1 (2020)

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

Dimas Dandy Aryarajendra Suprapto (Unknown)
Fauziah Fauziah (Universitas Nasional)

Article Info

Publish Date
05 Aug 2020

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.

Copyrights © 2020




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Full PDF
8392.897 KB
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
STRING (Satuan Tulisan Riset dan Inovasi Teknologi)
Website

Abbrev

STRING

Publisher

Universitas Indraprasta PGRI

Subject

Computer Science & IT Mathematics

Description

STRING (Satuan Tulisan Riset dan Inovasi Teknologi) focuses on the publication of the results of scientific research related to the science and technology. STRING publishes scholarly articles in Science and Technology Focus and Scope Covering: 1. Computing and Informatics 2. Industrial Engineering ...