Abstract
Automata theory is one of the core theories in computer science because it allows scientists and practitioners to understand the complexity of computational problems, and thus, to develop efficient solutions to them. Several formal methods such as model checking are based on automata theory. Automata theory has traditionally been taught on a theoretical level. Students learned to define abstract machines via pen and paper without the possibility to actually run these machines. Over the years several automata simulators have been introduced and employed in teaching automata theory. These tools offer rich features for designing and manipulating automata, but do not provide pedagogical guidance to the user. In this paper we present the AutomaTutor, an educational tool on automata theory that particularly targets learners without prior knowledge of theoretical computer science. The tool is a mobile application that offers guided learning by solving interactive exercises. Exercises can be randomly generated or customised by an educator. The user-friendly touch interface allows learners to solve exercises by constructing finite automata or regular expressions that match with given languages. Learners receive immediate feedback. The application’s focus on user experience and visualisation aims to make it accessible regardless of the technological background of the user. Our target is that the tool stimulates the students in their learning activities, and thus, leads to an improved understanding of automata theory and an increased interest in formal and theoretical aspects of computer science.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Chakraborty, P.: A language for easy and efficient modeling of Turing machines. Prog. Nat. Sci. 17(7), 867–871 (2007)
Chakraborty, P., Saxena, P.C., Katti, C.P.: Fifty years of automata simulation: a review. ACM Inroads 2(4), 59–70 (2011)
Chuda, D., Trizna, J., Kratky, P.: Android automata simulator. In: Proceedings of the International Conference on e-Learning, pp. 80–4 (2015)
Coffin, R.W., Goheen, H.E., Stahl, W.R.: Simulation of a Turing machine on a digital computer. In: Proceedings of the November 12–14, 1963, Fall Joint Computer Conference, pp. 35–43 (1963)
Cogliati, J.J., Goosey, F.W., Grinder, M.T., Pascoe, B.A., Ross, R.J., Williams, C.J.: Realizing the promise of visualization in the theory of computing. J. Educ. Resour. Comput. (JERIC) 5(2), 5–es (2005)
Google LLC.: Material design guidelines (2023). https://m3.material.io/
Hamada, M.: Supporting materials for active e-learning in computational models. In: Bubak, M., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2008. LNCS, vol. 5102, pp. 678–686. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-69387-1_79
Hannay, D.G.: Interactive tools for computation theory. ACM SIGCSE Bull. 34(4), 68–70 (2002)
Harris, J.: Programming non-deterministically using automata simulators. J. Comput. Sci. Coll. 18(2), 237–245 (2002)
Inc., A.: Human interface guidelines (2023). https://developer.apple.com/design/human-interface-guidelines/
Knuth, D.E., Bigelow, R.H.: Programming language for automata. J. ACM (JACM) 14(4), 615–635 (1967)
LoSacco, M., Rodger, S.: FLAP: a tool for drawing and simulating automata. Media 93, 310–317 (1993)
Pereira, C.H., Terra, R.: A mobile app for teaching formal languages and automata. Comput. Appl. Eng. Educ. 26(5), 1742–1752 (2018)
Robinson, M.B., Hamshar, J.A., Novillo, J.E., Duchowski, A.T.: A java-based tool for reasoning about models of computation through simulating finite automata and turing machines. In: The Proceedings of the Thirtieth SIGCSE Technical Symposium on Computer Science Education, pp. 105–109 (1999)
Rodger, S.H., Finley, T.W.: JFLAP: An Interactive Formal Languages and Automata Package. Jones & Bartlett Learning, Burlington (2006)
Rodger, S.H., Wiebe, E., Lee, K.M., Morgan, C., Omar, K., Su, J.: Increasing engagement in automata theory with JFLAP. In: Proceedings of the 40th ACM Technical Symposium on Computer Science Education, pp. 403–407 (2009)
Silva, R.C., Binsfeld, R.L., Carelli, I.M., Watanabe, R.: Automata defense 2.0: reediçao de um jogo educacional para apoio em linguagens formais e autômatos. In: Brazilian Symposium on Computers in Education (Simpósio Brasileiro de Informática na Educaçao-SBIE), vol. 1 (2010)
Singh, T., Afreen, S., Chakraborty, P., Raj, R., Yadav, S., Jain, D.: Automata simulator: a mobile app to teach theory of computation. Comput. Appl. Eng. Educ. 27(5), 1064–1072 (2019)
Traoré, M.K.: SimStudio: a next generation modeling and simulation framework. In: 1st International ICST Conference on Simulation Tools and Techniques for Communications, Networks and Systems (2010)
Vieira, M., Sarinho, V.: Automatamind: a serious game proposal for the automata theory learning. In: van der Spek, E., Göbel, S., Do, E.Y.-L., Clua, E., Baalsrud Hauge, J. (eds.) ICEC-JCSG 2019. LNCS, vol. 11863, pp. 452–455. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-34644-7_45
White, T.M., Way, T.P.: JFAST: a java finite automata simulator. In: Proceedings of the 37th SIGCSE Technical Symposium on Computer Science Education, pp. 384–388 (2006)
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
Jordaan, S., Timm, N., Marshall, L. (2024). AutomaTutor: An Educational Mobile App for Teaching Automata Theory. In: Barbosa, H., Zohar, Y. (eds) Formal Methods: Foundations and Applications. SBMF 2023. Lecture Notes in Computer Science, vol 14414. Springer, Cham. https://doi.org/10.1007/978-3-031-49342-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-031-49342-3_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-49341-6
Online ISBN: 978-3-031-49342-3
eBook Packages: Computer ScienceComputer Science (R0)