Modelling Finite State Automata to Find Shortest Path
- 10.2991/978-2-38476-056-5_43How to use a DOI?
- Shortest Path; Finite State Automata; Algorithm; graph
In this paper, we present a finite state automata (FSA) algorithm to find the shortest path from the origin to the destination. In this study, we chose Margonda as the initial state and UNINDRA Campus A and Campus B as the final states to accept input both from using public transportation or private vehicles. The FSA algorithm finds the shortest path based on the transition function, which can change from one state to another in response to some inputs, so that it can help provide path options to minimize travel time and cost. Besides, the FSA algorithm helps assist the testing process errors that occur in the process of finding the shortest path because the stages of finding the shortest path can be described simply using the FSA algorithm. The result shows that the proposed FSA algorithm has the ability to find the shortest path and can consider to be a solution of single source shortest path problem.
- © 2023 The Author(s)
- Open Access
- Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 4.0 International License (http://creativecommons.org/licenses/by-nc/4.0/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.
Cite this article
TY - CONF AU - Ni Wayan Parwati Septiani AU - Purwanti AU - Syamsiah AU - Nurfidah AU - Mei Lestari PY - 2023 DA - 2023/07/26 TI - Modelling Finite State Automata to Find Shortest Path BT - Proceedings of the 3rd International Conference on Education and Technology (ICETECH 2022) PB - Atlantis Press SP - 417 EP - 424 SN - 2352-5398 UR - https://doi.org/10.2991/978-2-38476-056-5_43 DO - 10.2991/978-2-38476-056-5_43 ID - Septiani2023 ER -