Didactic Strategy for Learning Theory of Automata & Formal Languages
Didactic Strategy for Learning Automata
Keywords:
Learning formal languages and automata theory, theory of computing, students’ disappointment, simulation tools, education, pair programmingAbstract
Formal languages and automata theory have a strong association with the core of information in the area of computer science. However, the courses on formal languages and automata theory is a challenging task and students generally do not find these courses very attractive and experience intricacy and impediment in learning the concepts. These intricacies stem from the difficult and unusual abstract concepts and the essential mathematical background. This paper presents a didactic strategy to simplify the hardness of the courses on formal languages and automata theory and aids to increase the interest and commitment of students in these courses. The proposed strategy supports a more imperative learning of the topics in formal languages and automata theory in an effective and fruitful way. The strategy initially evaluated and primary results are quite encouraging.
References
Chesñevar, C.I., M.L. Cobo. & W. Yurcik. Using theoretical computer simulators for formal languages and automata theory. ACM SIGCSE Bulletin 35: 33-37 (2003).
Pillay, N. Teaching the theory of formal languages and automata in the computer science undergraduate curriculum. South African Computer Journal 12:87-94 (2008).
Pillay, N. Learning difficulties experienced by students in a course on formal languages and automata theory. ACM SIGCSE Bulletin 41: 48-52(2010).
Lakshmi. & R. Sukumaran. Use of ICT in learning theory of computation: An experimental study. In: IEEE International Conference in MOOC Innovation and Technology in Education, Jaipur,India. p. 109-113 (2013).
Paul, J. Using jFlap to engage students and improve learning of computer science theory: tutorial presentation. Journal of Computing Sciences in Colleges 31: 145-148 (2015).
Korte, L., S. Anderson, H. Pain. & J. Good . Learning by game-building: a novel approach to theoretical computer science education. ACM SIGCSE Bulletin 39: 53-57 (2007).
Verma, R. M. A visual and interactive automata theory course emphasizing breadth of automata. ACM SIGCSE Bulletin 37: 325-329 (2005).
Moreira, N. & R. Reis. Interactive manipulation of regular objects with fado. ACM SIGCSE Bulletin 37: 335-339 (2005).
Chesnevar, C.I., M.P. Gonzalez. & A.G. Maguitman. Didactic strategies for promoting significant learning in formal languages and automata theory.ACM SIGCSE Bulletin 36: 7-11 (2004).
D’antoni, L., D. Kini, R. Alur, S. Gulwani, M. Viswanathan. & B. Hartmann. How can automatic feedback help students construct automata?, ACM Transactions on Computer-Human Interaction 22:(2015).
Moura, P. & A.M. Dias. L-flat: Logtalk toolkit for formal languages and automata theory. In: Proceedings of the 11th International Colloquium on Implementation of Constraint Logic Programming Systems, Kentucky, USA, (2011).
Morazan, M.T. & R. Antunez. Functional automata formal languages for computer science students. In: Proceedings of Trends in Functional Programming in Education, Soesterberg, The Netherlands, 19-32 (2014).
Berque, D., D.K. Johnson. & L. Jovanovic. Teaching theory of computation using pen-based computers and an electronic whiteboard. ACM SIGCSE Bulletin 33: 169-172 (2001).
Dol, S.M. Tps (think-pair-share): An active learning strategy to teach theory of computation course. International Journal of Educational Research and Technology 5: 62-67 (2014).
Castro-Schez, J. J., E.E. Castillo, J. Hortolano. & A. Rodriguez. Designing and using software tools for educational purposes: Flat, a case study. Transactions on Education 52: 66-74 (2009).
García-Osorio, C., I. Mediavilla-Sáiz, J. Jimeno-Visitación. & N. García-Pedrajas. Teaching pushdown
automata and turing machines. ACM SIGCSE
Bulletin 40: 316 (2008).
Devedzic, V., J. Debenham. & D. Popovic. Teaching
formal languages by an intelligent tutoring system.
Educational Technology & Society 3: 36-49 (2000).
Nóbrega, G., F. Lima & D. Freire. Integrating the semantic wiki approach to face to face courses. In: World Conference on Computers in Education, Bento Gonçalves, Brazil. p. 1-19 (2009).
Rodger, S. H., J. Lim. & S. Reading. Increasing interaction and support in the formal languages and automata theory course. ACM SIGCSE Bulletin 39:58-62 (2007).
Cavalcante, R., T. F. Cornell. & S. H. Rodger. A visual and interactive automata theory course with jflap 4.0. ACM SIGCSE Bulletin 36: 140-144 (2004).
Rodger, S. H., E. Wiebe, K. M. Lee, C. Morgan, K.Omar. & J. Su. Increasing engagement in automata theory with jflap. ACM SIGCSE Bulletin 4: 403-407(2009).
Jarvis, J., J.M. Lucas. Incorporating transformations into jflap for enhanced understanding of automata.
ACM SIGCSE Bulletin 40: 14-18 (2008).
D’Antoniy, L., M. Weavery, A. Weinertz & R. Alury. Automata tutor and what we learned from building an online teaching tool. Bulletin of EATCS 3; (2015).
de Souza, G.S., C. Olivete, R.C. Correia. & R.E. Garcia. Teaching-learning methodology for formal languages and automata theory. In: IEEE Frontiers in Education Conference, El Paso, USA. p. 1-7(2015).
de Souza, G.S., G.P.H. Gomes, R.C.M. Correia, C. Olivete, D.M. Eler. & R.E. Garcia. Combined methodology for theoretical computing. In Frontiers in Education Conference, Erie, USA. p.1-7 (2016).
Neeman, A. Buy one get one free: automata theory concepts through software test. Journal of Computing Sciences in Colleges 31: 90-96 (2016).
Singh, D. & A.I. Isah. An outline of the development of the theory of formal languages. International Journal of Latest Trends in Computing 5: 172-181(2014).
Myller, N., R. Bednarik, E. Sutinen. & M. Ben-Ari. Extending the engagement taxonomy: Software visualization and collaborative learning. ACM Transactions on Computing Education 9: 7:1-7:27(2009).
McDonald, J. Interactive pushdown automata animation. ACM SIGCSE Bulletin 34: 376-380 (2002).
Chud’a, D. Visualization in education of theoretical computer science. In: Proceedings of the 2007 international conference on Computer systems and technologies,; Rousse, Bulgaria. p. 84:1-84:6(2007).
Chud’a, D. & D. Rodina. Automata simulator. In: Proceedings of the 11th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing on International Conference on Computer Systems and Technologies, Sofia, Bulgaria. p. 394-399 (2010).
Chakraborty, P., P.C. Saxena. & C.P. Katti. Fifty years of automata simulation: a review. ACM Inroads; 2: 59-70 (2011).
Brown, C.W. & E.A. Hardisty. Regexex: an interactive system providing regular expression exercises. ACM SIGCSE Bulletin 39: 445-449(2007).
Esmoris, A., C.I. Chesnevar & M.P. Gonzalez. Tags:a software tool for simulating transducer automata. International journal of electrical engineering education 42: 338-349 (2005).
Grinder, M.T. A preliminary empirical evaluation of the effectiveness of a finite state automaton animator. ACM SIGCSE Bulletin; 35:157-161 (2003).
Stallmann, M.F., S.P. Balik, R.D. Rodman, S.
Bahram, M.C. Grace. & S.D. High. Proofchecker:
an accessible environment for automata theory
correctness proofs. ACM SIGCSE Bulletin 39: 48-
(2007).
Rodger, S.H. Integrating hands-on work into the
formal languages course via tools and programming.
In: International Workshop on Implementing
Automata Ontario, Canada. p. 132-148 (1996).
Lee, M.C. An abstract machine simulator. Lecture
Notes in Computer Science 438: 129-141 (1990).
Vieira, L.F., M.A. Vieira. & N.J. Vieira. Language
emulator, a helpful toolkit in the learning process
of computer theory. ACM SIGCSE Bulletin 36: 135-
(2004).
Hamada, M. Supporting materials for active
e-learning in computational models. Computational
Science 5102: 678-686 (2008).
McFall, R. & H.L. Dershem. Finite state machine
simulation in an introductory lab. ACM SIGCSE
Bulletin 2: 126-130 (1994).
Luce, E. & S.H. Rodger. A visual programming environment for Turing machines. In: Proceedings of IEEE Symposium on Visual Languages, Bergen, Norway, p. 231-236 (1993).
McDonald, J. Interactive pushdown automata nimation. ACM SIGCSE Bulletin; 34:376-380 (2002).
Grinder, M.T. A preliminary empirical evaluation of the effectiveness of a finite state automaton animator.ACM SIGCSE Bulletin 35: 157-161 (2003).
Hamada, M. & K.A. Shiina. Classroom experiment for teaching automata. ACM SIGCSE Bulletin 36:261-261 (2004).
White, T.M. & T.P. Way. jfast: A java finite automata simulator. ACM SIGCSE Bulletin 38: 384-388 (2006).
Devedzic, V., J. Debenham. & D. Popovic. Teaching formal languages by an intelligent tutoring system. Educational Technology & Society 3: 36-49 (2000).
Wermelinger, M. & A.M. Dias. A prolog toolkit for formal languages and automata. ACM SIGCSE Bulletin 37: 330-334 (2005).
Schreyer, B., W. Wawrzynski. Finite automata models for CS problem with binary semaphore. ACM SIGCSE Bulletin 38: 330-330 (2006).
Meinke K. & N. Walkinshaw. Model-Based Testing and Model Inference. In: Margaria T., Steffen B. (eds) Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change, Lecture Notes in Computer Science, Springer, Berlin, Heidelberg 7609 (2012).
Clarke E. M, O. Grumberg, M. Minea. & D. Peled. State space reduction using partial order techniques.
International Journal on Software Tools for
Technology Transfer 2: 279-87 (1999).
Sipser, M. Introduction to the Theory of Computation, 2nd ed. Boston. Thomson Course Technology Boston, USA (2006).
Cohen, D.I. Introduction to computer theory. 2nd ed. Wiley, New York, USA (1991).
Hopcroft, J.E., R. Motwani. & J.D. Ullman. Introduction to Automata Theory, Languages, and Computation, 2nd ed. Addison Wesley, New York, USA (2001).
Martin, J.C. Introduction to Languages and the Theory of Computation, 4th ed. McGraw-Hill, New York, USA (1991).
