TELAAH TEORITIS FINITE STATE AUTOMATA DENGAN PENGUJIAN HASIL PADA MESIN OTOMATA

Widyasari widyasari

Abstract


Abstracts: Otomata and language theory cannot be separated in the world of informatics and represents compulsory subjects that must be provided. Therefore, to produce software in engineering requires a model which can be the solution of a problem later, because the model is an idea that will be applied to generate a software engineering. As one model that mean in here is otomata machine which is the model that can recognize, accept/ generate a sentence in a particular language. It is necessary to understand how to do modeling and testing so that it can be concluded on otomata engine if the string entered correct or wrong. This study will only discuss about the correctness of the theory of otomata machine. The benefits of this research are expected to provide input in order to prove the truth of a study. From the results, some conclusions that prove the truth of the review.

 

Keywords: Automata, FSA, DFA, NFA.


Keywords


Automata; FSA; DFA; NFA;

Full Text:

PDF


DOI: http://dx.doi.org/10.30700/jst.v1i1.7

Article Metrics

Abstract view : 105 times
PDF - 875 times

Refbacks

  • There are currently no refbacks.


Badan Pengelola Jurnal Ilmiah Sistem Informasi dan Teknik Informatika (SISFOTENIKA) STMIK Pontianak.

 

Jurnal Ilmiah SISFOTENIKA terindex di :


   

   

  

    

    

    

   

SERTIFIKAT PENGHARGAAN :

Jurnal Ilmiah SISFOTENIKA Terakreditasi Peringkat Empat

 

Partners & Co-Organizers:

          



Lisensi Creative Commons

Jurnal Ilmiah SISFOTENIKA: STMIK Pontianak Online Journal ISSN Printed (2087-7897) - ISSN Online (2460-5344) licensed under a Lisensi Creative Commons Atribusi 4.0 Internasional.

View My Stats>