scholarly journals Penerapan Finite State Automata Pada Vending Machine Penjual Obat Non Resep Dokter Dan Keperluan Medis

2021 ◽  
Vol 9 (2) ◽  
pp. 08-14
Author(s):  
Eko Supriyanto ◽  
Angga Ardiansyah ◽  
Frieyadie Frieyadie ◽  
Sri Rahayu ◽  
Windu Gata
Keyword(s):  
Finite Automata ◽  
Finite State Automata ◽  
Deterministic Finite Automata ◽  
Finite State

Kebutuhan obat non resep dokter dan keperluan medis menjadi salah satu kebutuhan yang sangat penting untuk dipenuhi dengan mudah,cepat, tepat, dan aman bagi masyarakat saat ini, beragamnya pilihan  obat yang dijual   mengharuskan masyarakat mampu memilih dengan cermat dan tepat dalam membeli obat sesuai dengan kebutuhan penyakit yang dialami,informasi tentang kandungan, aturan pakai dan efek samping dari obat juga sangat penting untuk diketahui masyarakat guna memaksimalkan maanfaat dari obat yang dikonsumsi. Sistem penjualan obat yang tersedia saat ini adalah dengan penjualan langsung di apotek, toko kelontong dan secara daring yang memiliki keterbatasan dalam sebaran ketersedian toko dan waktu pelayanan yang terbatas. Penelitian ini bertujuan untuk memberikan alternatif sistem penjualan obat non resep dokter dan keperluan medis dengan memanfaatkan perkembangan teknologi vending machine (VM) menggunakan  finite state automata (FSA model Non-deterministic Finite Automata (NFA)). Dengan kelebihan penjualan menggunakan VM yang dapat diletakan dimana saja dan dapat beroperasi kapan saja membuat penjualan dengan sistem ini dapat tersedia kapanpun dan dimanapun untuk memenuhi kebutuhan obat dan keperluan medis bagi masyarakat yang mendesak dengan mudah,cepat, tepat, dan aman. Metode yang diterapkan dalam Penerapan FSA pada VM Penjual Obat Non Resep Dokter dan Keperluan Medis ini antara lain Finite State Automata VM Obat Non Resep Dokter dan Keperluan Medis, Perancangan Sistem VM Obat Non Resep Dokter dan Keperluan Medis,dan Desain VM Obat Non Resep Dokter dan Keperluan Medis. Berdasarkan perancangan FSA VM diatas, dihasilkan VM Penjual Obat Non Resep Dokter dan Keperluan Medis yang dapat diletakan dimana saja dan tersedia kapan saja, sehingga dapat disimpulkan penggunaan finite state automata (FSA) model Non-deterministic Finite Automata (NFA) dapat dimanfaatkan dalam pembuatan VM Penjual Obat Non Resep Dokter dan Keperluan Medis dengan menyediakan menu pilihan metode pembayaran tunai dan non tunai, kebutuhan akan obat dan keperluan medis yang mendesak bagi masyarakat dapat terpenuhi dengan mudah, cepat, tepat dan aman.

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

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.

scholarly journals OPTIMAL HYPER-MINIMIZATION

2011 ◽  
Vol 22 (08) ◽  
pp. 1877-1891 ◽  
Author(s):  
ANDREAS MALETTI ◽  
DANIEL QUERNHEIM
Keyword(s):  
Experimental Study ◽  
Finite Number ◽  
Open Problem ◽  
Finite Automata ◽  
Finite State Automata ◽  
Deterministic Finite Automata ◽  
Deterministic Automaton ◽  
Finite State ◽  
Minimization Algorithms ◽  
Run Time

Minimal deterministic finite automata (DFAs) can be reduced further at the expense of a finite number of errors. Recently, such minimization algorithms have been improved to run in time O(n log n), where n is the number of states of the input DFA, by [GAWRYCHOWSKI and JEŻ: Hyper-minimisation made efficient. Proc. MFCS, LNCS 5734, 2009] and [HOLZER and MALETTI: An n log n algorithm for hyper-minimizing a (minimized) deterministic automaton. Theor. Comput. Sci. 411, 2010]. Both algorithms return a DFA that is as small as possible, while only committing a finite number of errors. These algorithms are further improved to return a DFA that commits the least number of errors at the expense of an increased (quadratic) run-time. This solves an open problem of [BADR, GEFFERT, and SHIPMAN: Hyper-minimizing minimized deterministic finite state automata. RAIRO Theor. Inf. Appl. 43, 2009]. In addition, an experimental study on random automata is performed and the effects of the existing algorithms and the new algorithm are reported.

scholarly journals Penerapan Finite State Automata Pada Vending Machine Parfum Laundry Pakaian

2021 ◽  
Vol 8 (2) ◽  
pp. 103
Author(s):  
Yessica Fara Desvia ◽  
Rosadi Rosadi ◽  
Frieyadie Frieyadie ◽  
Tuti Haryanti ◽  
Windu Gata
Keyword(s):  
Finite Automata ◽  
Process Analysis ◽  
Finite State Automata ◽  
Deterministic Finite Automata ◽  
Floral Scents ◽  
State Diagrams ◽  
Business Process Analysis ◽  
Wide Range ◽  
Finite State ◽  
Design And Testing

Abstrak: Parfum banyak digemari oleh berbagai kalangan, salah satunya adalah parfum laundry. Parfum laundry memiliki berbagai macam varian aroma, meliputi aroma buah, aroma bunga, aroma perpaduan buah dan bunga, dan aroma kayu-kayuan. Parfum laundry ini merupakan rangkaian akhir dalam proses laundry. Saat ini pelanggan menerima hasil laundry dengan aroma parfum yang dipilih secara random sesuai ketersediaan pihak laundry, hal ini menjadi masalah karena pelanggan tidak dapat memilih aroma parfum laundry sesuai dengan keinginan mereka. Dengan alasan tersebut maka diperlukan suatu rancangan sebuah Vending Machine (VM), rancangan VM ini menggunakan metode Finite State Automata (FSA) dengan jenis Non-Deterministic Finite Automata (NFA), metode tersebut digunakan karena dapat mengakomodir lebih dari satu kondisi dalam satu pilihan. Metode FSA jenis NFA dibuat dengan tahapan analisa proses bisnis, diagram state, desain VM dan pengujian. Hasil dari penelitian ini dengan adanya VM pemilihan parfum laundry pakaian, maka mempermudah pelanggan untuk dapat memilih parfum laundry sehingga pelanggan memperoleh hasil laundry dengan aroma parfum sesuai pilihan mereka.   Kata kunci: finite state automata, parfum laundry, vending machine   Abstract: Perfume is much favored by various circles, one of which is laundry perfume. Laundry perfume has a wide range of scent variants, including fruity scents, floral scents, fruity floral scents, and woody scents. This laundry perfume is the final line in the laundry process. Currently customers receive laundry results with perfume scents selected randomly according to the availability of the laundry party, this is a problem because customers cannot choose laundry perfume scents according to their wishes. For this reason, it is necessary to design a Vending Machine (VM), this VM design uses the Finite State Automata (FSA) method with the Non-Deterministic Finite Automata (NFA) type, this method is used because it can accommodate more than one condition in one choice. The FSA type of NFA method is made with the stages of business process analysis, state diagrams, VM design and testing. The results of this study with the VM in the selection of clothes laundry perfume, it makes it easier for customers to be able to choose laundry perfumes so that customers get laundry results with the perfume scent of their choice.   Keywords: finite state automata, laundry perfume, vending machine

scholarly journals Penerapan Finite State Automata Pada Vending Machine Susu Kambing Etawa

MATICS ◽  
2021 ◽  
Vol 12 (2) ◽  
pp. 87-92
Author(s):  
Kartika Handayani ◽  
Dinar Ismunandar ◽  
Sukmawati Anggraeni Putri ◽  
Windu Gata
Keyword(s):  
Finite Automata ◽  
Finite State Automata ◽  
Market Place ◽  
Deterministic Finite Automata ◽  
Finite State

Susu kambing peranakan etawa merupakan susu bergizi tinggi yang memiliki banyak manfaat untuk tubuh manusia. Persebaran produk susu kambing etawa saat ini hanya sebatas penjualan di kendai atau market place sehingga manfaatnya belum merata dirasakan oleh masyarakat.Oleh karena itu, dirancang Vending Machine (VM) untuk penjualan susu kambing etawa untuk persebaran produk susu kambing etawa varian rasa menggunakan Finite State Automata (FSA)  jenis Non-Deterministic Finite Automata (NFA). FSA digunakan untuk menggambarkan alur logika VM susu kambing etawa ini. FSA merupakan mesin abstrak berupa sistem model matematika dengan masukan dan keluaran diskrit terdiri dari string dan label dengan output terdiri dari 0s dan 1s yang dapat mengenali bahasa paling sederhana (bahasa reguler) yang menangkap  pola dalam data dan dapat diimplementasikan secara nyata sehingga dapat dipahami oleh logika manusia. Dalam VM susu kambing etawa menggunakan FSA dilengkapi dengan dua metode pembayaran yaitu menggunakan uang tunai dan menggunakan e-money. Perancangan VM susu kambing etawa menggunakan FSA diharapkan dapat dikembangkan sehingga manfaat dari produk susu kambing etawa dapat dinikmati oleh masyarakat luas, khususnya masyarakat perkotaan.

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

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.

scholarly journals Penerapan Finite State Automata pada Vending Machine dalam Melakukan Transaksi Pengembalian Buku di Perpustakaan

METIK JURNAL ◽  
2021 ◽  
Vol 5 (1) ◽  
pp. 63-70
Author(s):  
Refi Riduan Achmad ◽  
Fahmi Fadillah Septiana ◽  
Nur Syamsi ◽  
Bobby Suryo Prakoso ◽  
Hafifah Bella Novitasari
Keyword(s):  
Finite Automata ◽  
Finite State Automata ◽  
Deterministic Finite Automata ◽  
Finite State

Revolusi Industri 4.0 dan Society 5.0 menuntut untuk terus mengembangkan bidang teknologi dan sumber daya manusia dalam seluruh ranah kehidupan. Penelitian ini bertujuan untuk memadukan antara teknologi dan upaya peningkatan literasi, dalam hal ini membahas tentang penerapan finite automata pada vending machine untuk mempermudah transaksi pengembalian buku di perpustakaan. Metode penelitian yakni melakukan penggambaran Finite State Automata menggunakan Non-deterministic Finite Automata, perancangan Diagram State mengenai fitur-fitur dan desain tampilan antarmuka saat Vending Machine diimplementasikan. Hasil penelitian menunjukkan bahwa penggunaan Non-deterministic Finite Automata pada desain Vending Machine pengembalian buku di perpustakaan dapat mempermudah transaksi pengembalian buku di perpustakaan.

LIMITED AUTOMATA AND REGULAR LANGUAGES

2014 ◽  
Vol 25 (07) ◽  
pp. 897-916 ◽  
Author(s):  
GIOVANNI PIGHIZZINI ◽  
ANDREA PISONI
Keyword(s):  
Finite Automata ◽  
Upper And Lower Bounds ◽  
Finite State Automata ◽  
Turing Machines ◽  
Double Exponential ◽  
Finite State ◽  
A Cell ◽  
Fixed Constant ◽  
The One ◽  
Context Free

Limited automata are one-tape Turing machines that are allowed to rewrite the content of any tape cell only in the first d visits, for a fixed constant d. In the case d = 1, namely, when a rewriting is possible only during the first visit to a cell, these models have the same power of finite state automata. We prove state upper and lower bounds for the conversion of 1-limited automata into finite state automata. In particular, we prove a double exponential state gap between nondeterministic 1-limited automata and one-way deterministic finite automata. The gap reduces to a single exponential in the case of deterministic 1-limited automata. This also implies an exponential state gap between nondeterministic and deterministic 1-limited automata. Another consequence is that 1-limited automata can have less states than equivalent two-way nondeterministic finite automata. We show that this is true even if we restrict to the case of the one-letter input alphabet. For each d ≥ 2, d-limited automata are known to characterize the class of context-free languages. Using the Chomsky-Schützenberger representation for contextfree languages, we present a new conversion from context-free languages into 2-limited automata.

FINITE AUTOMATA AND DIGITAL IMAGES

2000 ◽  
Vol 14 (04) ◽  
pp. 501-524 ◽  
Author(s):  
S. V. RAMASUBRAMANIAN ◽  
KAMALA KRITHIVASAN
Keyword(s):  
Normal Forms ◽  
Digital Images ◽  
Finite Automata ◽  
Finite State Automata ◽  
3D Object ◽  
3D Objects ◽  
Finite State

In this paper, we initially consider representation of 2D black–white images and 3D objects using finite state automata. We describe transformation of scaling on the 2D image by an operation on the FSA. We also give constructions for getting the projections of a 3D object on to coordinate planes and for reconstructing the 3D object from its projections. We define minimization of nondeterministic FSAs and give an O(e2) (e is the number of edges in the FSA) algorithm for minimization of NFAs. Later, we define a WFA and describe various properties of WFA. We define four normal forms of WFA and show how a WFA can be normalized into any of these forms. We show the equivalence of WFAs with ∊ edges and ∊-free WFAs. Then, we define minimization of WFAs and present an algorithm to minimize a WFA.

UNDECIDABILITY AND HIERARCHY RESULTS FOR PARALLEL COMMUNICATING FINITE AUTOMATA

2011 ◽  
Vol 22 (07) ◽  
pp. 1577-1592 ◽  
Author(s):  
HENNING BORDIHN ◽  
MARTIN KUTRIB ◽  
ANDREAS MALCHER
Keyword(s):  
Finite Automata ◽  
Input String ◽  
Finite State Automata ◽  
Common Input ◽  
Finite State ◽  
General Mode ◽  
Carry Over

Parallel communicating finite automata (PCFAs) are systems of several finite state automata which process a common input string in a parallel way and are able to communicate by sending their states upon request. We consider deterministic and nondeterministic variants and distinguish four working modes. It is known that these systems in the most general mode are as powerful as one-way multi-head finite automata. It is additionally known that the number of heads corresponds to the number of automata in PCFAs in a constructive way. Thus, undecidability results as well as results on the hierarchies induced by the number of heads carry over from multi-head finite automata to PCFAs in the most general mode. Here, we complement these undecidability and hierarchy results also for the remaining working modes. In particular, we show that classical decidability questions are not semi-decidable for any type of PCFAs under consideration. Moreover, it is proven that the number of automata in the system induces infinite hierarchies for deterministic and nondeterministic PCFAs in three working modes.

Implementasi Finite State Automata Dalam Siklus Pembelajaran Magister Ilmu Komputer STMIK Nusa Mandiri

2020 ◽  
Vol 5 (2) ◽  
pp. 221
Author(s):  
Angelina Puput Giovani ◽  
Faried Zamachsari ◽  
Efid Dwi Agustono ◽  
Muhammad Ilham Prasetya ◽  
Windu Gata
Keyword(s):  
Finite Automata ◽  
Finite State Automata ◽  
Nondeterministic Finite Automata ◽  
Finite State

Menyelesaikan Pendidikan Magister Ilmu Komputer pada STMIK Nusa Mandiri dalam waktu 4 semester merupakan harapan setiap mahasiswa. Untuk dapat lulus tepat waktu setiap mahasiswa wajib memenuhi semua persyaratan yang telah ditentukan oleh pihak kampus. Dalam tiap semester terdapat berbagai kegiatan diluar kegiatan belajar mengajar yang wajib diikuti oleh mahasiswa. Kegiatan tersebut meliputi Seminar, Workshop, dan Tes TOEFL. Hal-hal tersebut seringkali tidak diketahui mahasiswa sehingga tidak lulus mata kuliah tertentu. Apabila seorang mahasiswa dinyatakan tidak lulus mata kuliah tertentu maka diwajibkan untuk mengulang di semester berikutnya. Mengulang mata kuliah akan menambah pengeluaran dan tentunya menambah waktu belajar sehingga tidak dapat lulus tepat waktu sesuai yang diharapkan. Pada paper ini akan membahas tentang bagaimana Finite State Automata (FSA) jenis Nondeterministic Finite Automata (NFA) dapat diimplementasikan dalam siklus pembelajaran Magister Ilmu Komputer pada STMIK Nusa Mandiri. Dengan diterapkan metode ini  diharapkan dapat membantu mahasiswa dalam pemenuhan persyaratan untuk mencapai kelulusan

Sign in / Sign up

Export Citation Format

Share Document