Nelishia Pillay
Abstract
Students taking courses on formal languages and automata theory (FLAT) usually do not find these courses interesting and experience difficulty in grasping the different concepts. While there has been a vast amount of research into methodologies to assist students to conceptualize FLAT topics, there has been no research into the actual learning difficulties experienced by students with the different topics. This paper reports on the findings of a study conducted to identify these learning difficulties for some of the FLAT topics.
- Berque, D., Johnson, D.K., and Jovanovic, L. 2001. Teaching Theory of Computation Using Pen-Based Computers and an Electronic Whiteboard. ACM SIGCSE Bulletin inroads 33, 3, 169--172. Google Scholar
Digital Library
- Chesnevar, C.I., Cobo, M. L., and Yurcik, W. 2003. Using Theoretical Computer Simulators for Formal Languages and Automata Theory. ACM SIGCSE Bulletin inroads 35, 2, 33--37. Google ScholarDigital Library
- Devedzic, V., Debenham, J., and Popvic D. 2000. Teaching Formal Languages by an Intelligent Tutoring System. Educational Technology and Society 3, 2, ISSN 1436-4522.Google Scholar
- Esmoris, A., Chesnevar, C. I., and Gonzalez M. P. 2005. TAGS: A Software Tool for Simulating Transducer Automata. International Journal of Electrical Engineering Education 42, 4, 338--349.Google ScholarCross Ref
- Garcia-Osorio, C., Mediavilla-Saiz, I., Jimeno-Visitacion, J., and Garcia-Pedrajas N. 2008. Teaching Pushdown Automata and Turing Machines, inroads -- SIGCSE Bulletin, 40, 3, 316. Google ScholarDigital Library
- Pillay, N. and Naidoo, A. 2006. An Investigation into the Automatic Generation of Solutions to Problems in an Intelligent Tutoring System for Finite Automata. Proceedings of the 36th SACLA Conference-2006, 84--93.Google Scholar
- Rodger, S.H., Wiebe, E., Lee, M. E. 2009. Increasing Engagement in Automata Theory with JFLAP. Inroads SIGCSE Bulletin 41, 1, 403--407. Google ScholarDigital Library
- Vieira, L. F. M., Vieira, M. A. M., and Vieira, N. J. 2004. Language Emulator, A Helpful Toolkit in the Learning Process of Computer Theory. ACM SIGCSE Bulletin inroads 36, 1, 135--139. Google ScholarDigital Library
- Wermelinger, M., and Dias, A. M. 2005. A Prolog Toolkit for Formal Languages and Automata. ACM SIGCSE Bulletin-inroads 38, 3, 330--334. Google ScholarDigital Library
- Zingaro, D. 2008. Another Approach for Resisting Student Resistance to Formal Methods. inroads-SIGCSE Bulletin. 40, 4, 56--57. Google ScholarDigital Library
Index Terms
- Learning difficulties experienced by students in a course on formal languages and automata theory
Recommendations
Limited Automata and Context-Free Languages
Non-Classical Models of Automata and Applications VLimited automata are one-tape Turing machines which are allowed to rewrite each tape cell only in the first d visits, for a given constant d. For each d ≥ 2, these devices characterize the class of context-free languages. We investigate the equivalence ...
Increasing interaction and support in the formal languages and automata theory course
Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (ITiCSE'07)The introduction of educational software such as JFLAP into the course Formal Languages and Automata (FLA) has created a learning environment with automatic feedback on theoretical topics. In this paper we show how we further increase the interaction in ...
Deterministic Pushdown Automata and Unary Languages
CIAA '08: Proceedings of the 13th international conference on Implementation and Applications of AutomataThe simulation of deterministic pushdown automata defined over a one letter alphabet by finite state automata is investigated from a descriptional complexity point of view. We show that each unary deterministic pushdown automaton of size s can be ...
Comments