Abstract
Cricket is one of the most viewed sports in the world and tracking of this game is very important throughout the gameplay. The application of automata in sports is least explored and this paper proposes the use of automata theory in cricket. The paper sheds light upon the potential application of finite automata concept in cricket which proposes proper tracking flow of the game. The major focus of the paper is shown upon ball-tracking and on-strike batsman tracking with each tracking system being explained in detail using the state diagrams. With the help of Deterministic Finite Automata (DFA), it is possible to achieve the flow of track and thus, helps in efficient tracking of the sport. It also minimizes the rate of committing the tracking errors during the gameplay.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Caillois, R.: Man, Play, and Games. University of Illinois press, Champaign (2001)
Best, D.: Art and sport. J. Aesthetic Educ. 14(2), 69–80 (1980)
Gurram, S.: Classification of sequential sports using automata theory. New Approaches Exerc. Physiol. 2(4), 100–134 (2020)
Lee, J., Lee, J., Moon, S., Nam, D., Yoo, W.: Basketball event recognition technique using deterministic finite automata (DFA). In: 2018 20th International Conference on Advanced Communication Technology (ICACT), pp. 675–678. IEEE, Korea (South) (2018)
The Laws of Cricket, https://www.lords.org/mcc/the-laws-of-cricket. Accessed 10 Nov 2022
Potechin, A., Shallit, J.: Lengths of words accepted by nondeterministic finite automata. Inf. Process. Lett. 162, 105993 (2020)
Ransikarbum, K., Kim, N., Ha, S., Wysk, R.A., Rothrock, L.: A highway-driving system design viewpoint using an agent-based modeling of an affordance-based finite state automata. IEEE Access 6, 2193–2205 (2017)
Gribkoff, E.: Applications of deterministic finite automata. UC Davis, pp. 1–9 (2013)
Krishnan, P., Aravindhar, D.J., Reddy, P.B.P.: Finite automata for fake profile identification in online social networks. In: 2020 4th International Conference on Intelligent Computing and Control Systems (ICICCS), pp. 1301–1305. IEEE, India (2020)
Eilouti, B., Vakalo, E.G.: Finite state automata as form-generation and visualization tools. In: 1999 IEEE International Conference on Information Visualization (Cat. No. PR00210), pp. 220–224. IEEE, UK (1999)
Vandana, S.S., Abinandhan, K., Ramesh, S.R.: Implementation of smart home using finite state machine model. In: 2022 7th International Conference on Communication and Electronics Systems (ICCES), pp. 45–49. IEEE, India (2022)
Slamet, C., Gerhana, Y.A., Maylawati, D.S., Ramdhani, M.A., Silmi, N.Z.: Latin to Sundanese script conversion using finite state automata algorithm. In:Â IOP Conference Series: Materials Science and Engineering, vol. 434, no. 1, p. 012063. IOP Publishing, Indonesia (2018)
Liu, Z.M.: Online pulse deinterleaving with finite automata. IEEE Trans. Aerosp. Electron. Syst. 56(2), 1139–1147 (2019)
Viard, K., Fanti, M.P., Faraut, G., Lesage, J.J.: Recognition of human activity based on probabilistic finite-state automata. In: 2017 22nd IEEE International Conference on Emerging Technologies and Factory Automation (ETFA), pp. 1–7. IEEE, Cyprus (2017)
Dutta, M., Saikia, H.K.: Automata in Chinese remainder theorem. Commun. Math. Appl. 13(1), 183–197 (2022)
Kurniawan, O., Ismaya, F., Gata, W., Putra, J.L., Nugraha, F.S.: Application of the finite state automata concept in applications fruit vending machine simulation. Jurnal Mantik 6(2), 1467–1474 (2022)
Egyir, R.J., Devendorf, R.P.: Design of a Cricket Game Using FPGAs (2020)
Ali, L., Sahawneh, N., Kanwal, S., Ahmed, I., Elmitwally, N.: Activity based easy learning of pushdown automata. In: 2022 International Conference on Cyber Resilience (ICCR), pp. 1–8. IEEE, United Arab Emirates (2023)
Singh, R., Goyal, G.: Algorithm design for deterministic finite automata for a given regular language with prefix strings. J. Sci. Res. 66(2), 16–21 (2022)
Vayadande, K.B., Sheth, P., Shelke, A., Patil, V., Shevate, S., Sawakare, C.: Simulation and testing of deterministic finite automata machine. Int. J. Comput. Sci. Eng.Comput. Sci. Eng. 10(1), 13–17 (2022)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Kaushik, K., Pavithra, L.K., Subbulakshmi, P. (2024). Finite Automata Application in Monitoring the Digital Scoreboard of a Cricket Game. In: Aurelia, S., J., C., Immanuel, A., Mani, J., Padmanabha, V. (eds) Computational Sciences and Sustainable Technologies. ICCSST 2023. Communications in Computer and Information Science, vol 1973. Springer, Cham. https://doi.org/10.1007/978-3-031-50993-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-031-50993-3_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-50992-6
Online ISBN: 978-3-031-50993-3
eBook Packages: Computer ScienceComputer Science (R0)