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

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 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. 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.

Download Full-text

Mobile Learning Application for Language and Automata Theory using Android-based

Jurnal Online Informatika ◽

10.15575/join.v5i2.630 ◽

2020 ◽

Vol 5 (2) ◽

pp. 176

Author(s):

Maulana Muhamad Sulaiman ◽

Romi Andrianto ◽

Muhamad Arief Yulianto

Keyword(s):

Mobile Learning ◽

Finite Automata ◽

Automata Theory ◽

Finite State Automata ◽

Design Development ◽

Study Program ◽

Deterministic Finite Automata ◽

Implementation Evaluation ◽

Finite State ◽

Evaluation Of Learning

The language and automata theory are which required course must implemented by college student in informatic engineering study program. In this course, there are finite state automata (FSA) and deterministic finite automata (DFA) which are important materials in language and automata theory. This material requires more understanding of mathematical logic from students to determine an input which can be accepted or rejected in an abstract machine system. The assist students to understand the material, it is need to develop the learning media for mobile learning applications for language and automata theory on finite state automata (FSA) and deterministic finite automata (DFA) based on android as an evaluation of learning media for students. And the development of this learning media use the ADDIE development model (analysis, design, development, implementation, evaluation) to design language and automata theory applications learning so can be support the learning process for students and then assist lecturer to explain the material more dynamic and applicative.

Download Full-text

“M-Auto” The Augmented Reality-Based (AR) Learning Media Application for the Finite-State Automata (FA) Reduction Subject of Language and Automata Theory Courses

Journal of Disruptive Learning Innovation (JODLI) ◽

10.17977/um072v1i22020p45-58 ◽

2020 ◽

Vol 1 (2) ◽

pp. 45

Author(s):

Fajar Ananda Saputra ◽

F Ti Ayyu Sayyidul Laily ◽

Dimas Prasetyo Buseri ◽

Imro’aturrozaniyah Imro’aturrozaniyah ◽

Kartika Candra Kirana

Keyword(s):

Augmented Reality ◽

System Development ◽

Automata Theory ◽

Learning Activity ◽

Finite State Automata ◽

Need Analysis ◽

Library Research ◽

Finite State ◽

The Subject ◽

Learning Interest

AbstractA proper learning process should contain innovative, amusing, challenging, and motivating aspects. It should be able to provide an opportunity for the students to develop their creativity and independence based on their interests and talent. Less interesting and tedious classroom learning activity indicates the factor of the students’ learning interest degradation, for example as in the language and automata theory and finite-state automata reduction subject. The current research aims to aid language and automata theory in a learning activity to be easier to acquire. With the Augmented Reality-based learning media, the researcher hopes that the students can develop their understanding and their interest in a learning activity, especially for finite-state automata subjects. The subject of the current research is the Augmented Reality-based application as the learning media for language and automata theory and finite-state automata material. The researcher employs several research methodologies such as literature review, library research, and questionnaire to support the current research. The application is designed according to system development that consists of problem identification, appropriateness study, need analysis, concept designing, content designing, script designing, graphic designing, system production, and system examination. The result of the current research is the AR-based learning media application for the finite-state automata reduction subject of language and automata theory. Keywords: Learning Media, Finite-State Automata Reduction, Augmented Reality

Download Full-text

On some applications of finite-state automata theory to natural language processing

Natural Language Engineering ◽

10.1017/s135132499600126x ◽

1996 ◽

Vol 2 (1) ◽

pp. 61-80 ◽

Cited By ~ 35

Author(s):

MEHRYAR MOHRI

Keyword(s):

Natural Language Processing ◽

Natural Language ◽

Language Processing ◽

Large Scale ◽

Automata Theory ◽

Finite State Automata ◽

Finite State ◽

New Applications ◽

New Algorithms

We describe new applications of the theory of automata to natural language processing: the representation of very large scale dictionaries and the indexation of natural language texts. They are based on new algorithms that we introduce and describe in detail. In particular, we give pseudocodes for the determinisation of string to string transducers, the deterministic union of p-subsequential string to string transducers, and the indexation by automata. We report on several experiments illustrating the applications.

Download Full-text

Desain Game Edukasi Ilmu Tajwid Bagi Anak Usia Dini menggunakan Pemodelan Finite State Automata

EDUMATIC Jurnal Pendidikan Informatika ◽

10.29408/edumatic.v5i1.3317 ◽

2021 ◽

Vol 5 (1) ◽

pp. 80-88

Author(s):

Yanto Yanto ◽

◽

Dinar Ismunandar ◽

Erni Erni ◽

Santoso Setiawan ◽

...

Keyword(s):

Early Childhood ◽

Finite Automata ◽

Automata Theory ◽

Early Age ◽

Input State ◽

Finite State Automata ◽

Deterministic Finite Automata ◽

Development Stages ◽

Finite State ◽

Further Development

This study discusses how Finite State Automata (FSA) can be used as a model to design a Tajweed Science game application as a business diagram. This study aims to facilitate early childhood in learning the science of recitation by grouping hijaiyah letters into grouping the science of recitation by using a touch of the hand. The type of automata theory used is a non-deterministic finite automata with epsilon transition (E) or better known as E-NFA. Each transition, input, state that exists from the NFA, is basically to show the characteristics or states that occur in a game application. The importance of this research, in addition to learning recitation from an early age, is to show that automata theory can be used to help design a system in making game applications. The results of this Tajweed Science game application design are a rough display because there will still be further development stages and can ensure that game applications can be built from E-NFA modeling.

Download Full-text