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

Abstract

Introduction: Amusement Park is a place that provides various attractions for entertainment
purpose. 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 humans
are now being replaced by computers. With an automated ticket selling machine, the process
of buying the ticket of an amusement park becomes easier for the user. Automata theory is a
theoretical branch that has not been widely known to many yet plays essential role in the field
of computer science. The main concept of automata theory itself is how to make machines
works automatically. Therefore, this study aims to show the implementation of the concept of
Automata theory in an amusement park automatic ticket selling machine.Methods: The
method 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 a
mathematical modelling that links the production, development, and verification of software
and hardware. In this application, the concept of Finite State Automata was applied to
recognize and then capture the pattern on the process of ticket selling machine.Results: The
result of this study shows that Finite State Automata can become one of the alternatives to
design an automatic ticket selling machine for an amusement park by reading each input
given by the user and then converts it to the language know by the Finite State
Automata.Discussion: In this application, the payment method is by inserting a certain
amount 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 of
inserting cash, user can choose to pay using debit as well as credit card.