Representation of Vending Device using Finite State Automata


Authors : Lakshin Pathak; Yashvi Shah

Volume/Issue : Volume 9 - 2024, Issue 8 - August


Google Scholar : https://tinyurl.com/3wb45exp

Scribd : https://tinyurl.com/4jxa7cbe

DOI : https://doi.org/10.38124/ijisrt/IJISRT24AUG849

Note : A published paper may take 4-5 working days from the publication date to appear in PlumX Metrics, Semantic Scholar, and ResearchGate.


Abstract : Automata theory predominates in a number of applications derived using the technique of a finite state machine . In the paper, we study the representation of a vending machine (VM) that enhances the academic institution’s book delivery service using the concepts of the computation theories. The effectiveness regarding the virtual machine(VM) is viewed as a problem. Automata theory relies on the finite state machine (FSM) design to increase efficiency. The different components of a vending machine are examined at, and it is determined how they can be modelled as finite state machines. We go over the architectural considerations for vending machines, such as the selection of components, the layout of the machine, and the selection of input and output approaches. We use the theory of computation to examine the constraints and difficulties in vending machine design. The paper will design an FSM with fewer states in the end. As a result, we will learn how to increase the VM’s design effectiveness and cost.

Keywords : Vending Machine, Finite State Machine (FSM),Virtual Machine (VM), Automata Theory.

References :

  1. Zhang, W., Zhang, X.L.: Design and implementation of automatic vending machine based on the short massage payment. In: 2010 6th International Conference on Wireless Communications Networking and Mobile Computing (WiCOM), pp. 1–4 (2010). IEEE
  2. Caulfield, B., Mahony, M.: Passenger requirements of a public transport ticketing system. In: Proceed- ings of the 8th International IEEE Conference on Intelligent Transportation Systems Vienna, pp. 32–37 (2005). Vienna, Austria
  3. Roy, B., Mukherjee, B.: Design of a coffee vending machine using single electron devices:(an example of sequential circuit design). In: 2010 International Symposium on Electronic System Design, pp. 38–43 (2010). IEEE
  4. Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to automata theory, languages, and computa- tion. Acm Sigact News 32(1), 60–65 (2001)
  5. Varkey, M., Sunny, J.: Design and implementation of multi select smart vending machine. International Journal of Computer Networks and Wireless Communications (IJCNWC), ISSN, 2250–3501 (2014)
  6. Bhuvaneswari, M., Sukhumar, S., Divya, N., Kalpanadevi, S., SuthanthiraVanitha, N.: Embedded sys- tem based automatic ticket vending machine for modern transport system. International Journal of Advanced Research in Computer and Communication Engineering 2(11) (2013)
  7. Monga, A., Singh, B.: Finite state machine based vending machine controller with auto-billing features. arXiv preprint arXiv:1205.3642 (2012)
  8. Qureshi, M.A., Aziz, A., Rasool, H.F., Ibrahim, M., Ghani, U., Abbas, H.: Design and implementa- tion of vending machine using verilog hdl. In: 2011 2nd International Conference on Networking and Information Technology, IPCSIT, vol. 17 (2011)
  9. Thayananthan, V., Alrehily, A., Fallatah, R.: Automata design with time complexity for intelligent vending machine based on visual automata simulator. In: IEEE 17th International Conference on Computer Modelling and Simulation, UK, pp. 159–164 (2015)
  10. Pin, J.-E´.: Mathematical foundations of automata theory. Lecture notes LIAFA, Universit´e Paris 7, 73 (2010)
  11. Holub,  J.,  Sˇtekr,  S.:  On  parallel  implementations  of  deterministic  finite  automata.  In:  International Conference on Implementation and Application of Automata, pp. 54–64 (2009). Springer
  12. Dash, T., Nayak, T.: Quantum finite automata: a language acceptor model. International Journal of Advanced Research in Computer Science and Software Engineering 2(9) (2012)
  13. Ali, F., Shaker, E.-S., Khan, P., Kwak, K.-S.: Feature-based transportation sentiment analysis using fuzzy ontology and sentiwordnet. In: 2018 International Conference on Information and Communication Technology Convergence (ICTC), pp. 1350–1355 (2018). IEEE

14. Rubacha, M., Rattan, A.K., Hosselet, S.C.: A review of electronic laboratory notebooks available in the market today. JALA: Journal of the Association for Laboratory Automation 16(1), 90–98 (2011)

Automata theory predominates in a number of applications derived using the technique of a finite state machine . In the paper, we study the representation of a vending machine (VM) that enhances the academic institution’s book delivery service using the concepts of the computation theories. The effectiveness regarding the virtual machine(VM) is viewed as a problem. Automata theory relies on the finite state machine (FSM) design to increase efficiency. The different components of a vending machine are examined at, and it is determined how they can be modelled as finite state machines. We go over the architectural considerations for vending machines, such as the selection of components, the layout of the machine, and the selection of input and output approaches. We use the theory of computation to examine the constraints and difficulties in vending machine design. The paper will design an FSM with fewer states in the end. As a result, we will learn how to increase the VM’s design effectiveness and cost.

Keywords : Vending Machine, Finite State Machine (FSM),Virtual Machine (VM), Automata Theory.

Never miss an update from Papermashup

Get notified about the latest tutorials and downloads.

Subscribe by Email

Get alerts directly into your inbox after each post and stay updated.
Subscribe
OR

Subscribe by RSS

Add our RSS to your feedreader to get regular updates from us.
Subscribe