Implementation of Finite State Automata in an Amusement Park Automatic Ticket Selling Machine

  • Fergie Joanda Kaunang Universitas Advent Indonesia
  • Jacquline Waworundeng Universitas Klabat
Keywords: Automata Theory, Formal Methods, finite state automata, amusement park, automatic ticket selling machine

Abstract

Introduction: Amusement Park is a place that provides various attractions for entertainmentpurpose. People can enjoy games, rides such as roller coaster rides, merry-go-round, etc.Over the time, technology has grown. Many things that are usually done manually by humansare now being replaced by computers. With an automated ticket selling machine, the processof buying the ticket of an amusement park becomes easier for the user. Automata theory is atheoretical branch that has not been widely known to many yet plays essential role in the fieldof computer science. The main concept of automata theory itself is how to make machinesworks automatically. Therefore, this study aims to show the implementation of the concept ofAutomata theory in an amusement park automatic ticket selling machine.Methods: Themethod used to develop the application is formal methods known as Finite State Automata.We also used Sequential Linear method to design the application. Formal method is amathematical modelling that links the production, development, and verification of softwareand hardware. In this application, the concept of Finite State Automata was applied torecognize and then capture the pattern on the process of ticket selling machine.Results: Theresult of this study shows that Finite State Automata can become one of the alternatives todesign an automatic ticket selling machine for an amusement park by reading each inputgiven by the user and then converts it to the language know by the Finite StateAutomata.Discussion: In this application, the payment method is by inserting a certainamount of cash into the machine and the machine will proceed to the next process. However,for future development another payment method can be added. For example, instead ofinserting cash, user can choose to pay using debit as well as credit card.
Article Metrics

Downloads

Download data is not yet available.

References

Balaji, S., & Murugaiyan, M. S. (2012). Waterfall vs. V-Model vs. Agile: A comparative study on SDLC. International Journal of Information Technology and Business Management, 2(1), 26-30.

Hopcroft, J. E. (2008). Introduction to automata theory, languages, and computation: Pearson Education India.

Linz, P. (2006). An introduction to formal languages and automata: Jones & Bartlett Learning.

Putra, Y. M. R. (2017). Sentence Analysis with Artificial Intelligence Machine Learning Using Finite State Automata. PROXIES, 1(1), 1-6.

Rahadian, M. F., Suyatno, A., & Maharani, S. (2017). Penerapan Metode Finite State Machine Pada Game “The Relationship”.

Setiawan, I. (2006). Perancangan Software Embedded System Berbasis FSM. Semarang: Universitas Diponegoro.

Utdirartatmo, F. (2005). Teori Bahasa dan Otomata. Graha Ilmu, Yogyakarta, Ed 2.

Published
2019-12-18
How to Cite
Kaunang, F., & Waworundeng, J. (2019). Implementation of Finite State Automata in an Amusement Park Automatic Ticket Selling Machine. Abstract Proceedings International Scholars Conference, 7(1), 1801-1810. https://doi.org/10.35974/isc.v7i1.1979