Penerapan Finite State Automata Pada Vending Machine Cangklong Rokok
نویسندگان
چکیده
Salah satu masalah kesehatan dunia disebabkan oleh rokok. Menurut Organisasi Kesehatan Dunia (WHO), ada 2,5 miliar perokok di dunia, dua pertiganya negara berkembang. Pandemi Covid 19 menyebabkan penurunan daya beli masyarakat karena sebagian besar mengurangi aktivitas luar ruangan untuk menekan penyebaran 19. Strategi yang dapat dilakukan memasarkan cangklong rokok yaitu dengan memanfaatkan Vending Machine (VM). VM mesin otomatis ang berjalan secara independen dan menyediakan transaksi memenuhi kebutuhan manusia, seperti pembelian. Dalam jenis FSA ini, terdapat bahasa mengenali, menerima, menolak Deterministic Finite Automata (DFA) Nondeterministic (NFA).
منابع مشابه
Penerapan teknik web scraping pada mesin pencari artikel ilmiah
Search engines are a combination of hardware and computer software supplied by a particular company through the website which has been determined. Search engines collect information from the web through bots or web crawlers that crawls the web periodically. The process of retrieval of information from existing websites is called "web scraping." Web scraping is a technique of extracting informat...
متن کاملFinite State Machine based Vending Machine Controller with Auto-Billing Features
Nowadays, Vending Machines are well known among Japan, Malaysia and Singapore. The quantity of machines in these countries is on the top worldwide. This is due to the modern lifestyles which require fast food processing with high quality. This paper describes the designing of multi select machine using Finite State Machine Model with Auto-Billing Features. Finite State Machine (FSM) modelling i...
متن کاملResidual Finite State Automata
We introduce a subclass of non deterministic finite automata (NFA) that we call Residual Finite State Automata (RFSA): a RFSA is a NFA all the states of which define residual languages of the language it recognizes. We prove that for every regular language L, there exists a unique RFSA that recognizes L and which has both a minimal number of states and a maximal number of transitions. Moreover,...
متن کاملRepresentation of Finite State Automata
In this paper, we propose some techniques for injecting nite state automata into Recurrent Radial Basis Function networks (R 2 BF). When providing proper hints and constraining the weight space properly, we show that these networks behave as automata. A technique is suggested for forcing the learning process to develop automata representations that is based on adding a proper penalty function t...
متن کاملRobustness of Finite State Automata
The classical robust control deals with systems which can be approximated by nite order linear time-invariant (LTI) models, uses integral constraints, such as induced gain bounds, to assess robustness with respect to the error of such approximation, and employs H-In nity optimization to design robust linear controllers. In this paper, a parallel approach is developed, in which nite state stocha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal Ilmu Komputer dan Bisnis
سال: 2022
ISSN: ['2087-3921', '2598-9715']
DOI: https://doi.org/10.47927/jikb.v13i2.278