Penerapan Konsep Non-Deterministic Finite Automata (NFA) pada Aplikasi Simulasi Mesin Kopi Vending

Authors

  • Benny Richardson Universitas Multimedia Nusantara
  • Kevin Hendy Universitas Multimedia Nusantara
  • Ventryshia Andiyani Universitas Multimedia Nusantara
  • Wilson Philips Universitas Multimedia Nusantara

DOI:

https://doi.org/10.32493/informatika.v4i1.2062

Keywords:

Coffee Machines, Non-Deterministic Finite Automata, Automata Theory and Languages

Abstract

In this research, an application for the simulation of vending coffee machines will be discussed using the concept of Non-Deterministic Finite Automata (NFA). With the projected growth in coffee consumption in Indonesia, which increases every year, vending machines can be one of the innovations that can be applied to coffee machines. This coffee vending machine can make 6 coffee variants, with its temperature and desired glass size. There is also a system of cash payments that are applied to this vending coffee machine, where the change will be issued according to the excess balance that is available. The method used is the formal method, to link the design of formal specifications with the application flowchart. Based on the test results obtained, the concept of Non-Deterministic Finite Automata (NFA) can be used as an alternative in the design of vending coffee machines.

References

Butler, R. (2018, November 6). What is Formal Methods? Retrieved from NASA Langley Formal Methods Research Program: https://shemesh.larc.nasa.gov/fm/fm-what.html

Rizky Indah Melly E.P, W. D. (2012). Penerapan Konsep Finite State Automata (FSA) pada Mesin Pembuat Minuman Kopi Otomatis. Jurnal Komputasi, 95-102.

Yolanda, F. (2018, November 4). Pertumbuhan Konsumsi Kopi Diproyeksi Meningkat Tujuh Persen. Retrieved from Republika: https://republika.co.id/berita/ekonomi/korporasi/18/10/18/pgshsz370-pertumbuhan-konsumsi-kopi-diproyeksi-meningkat-tujuh-persen

Published

2019-03-30