A visual and interactive automata theory course emphasizing breadth of automata

Proceedings of the 10th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education

Volumn , Issue , 2005, Pages 325-329

  Verma, Rakesh M ^a  

^a UNIVERSITY OF HOUSTON   (United States)

Author keywords

Formal Languages; Rule based Programming; String Automata; Tree Automata

Indexed keywords

COMPUTER SCIENCE; CURRICULA; FORMAL LANGUAGES; LOGIC PROGRAMMING; STUDENTS; TEACHING; VISUALIZATION;

FINITE AUTOMATA CONCEPTS; STRING AUTOMATA; TREE AUTOMATA;

EDUCATION;

EID: 29844456776     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1067445.1067535     Document Type: Conference Paper

References (26)

1. Jon Barwise and John Etchemendy. Turing's world 3.0. CSLI lecture notes no. 35. CSLI publications. Technical report, Stanford University, 1993.
2. Jon Barwise and John Etchemendy. Computers, visualization and the nature of reasoning. In T.W. Bynum and James H. Moor, editors. The Digital Phoenix: How Computers are Changing Philosophy, pages 93-116. London; Blackwell, 1998.
3. R. Cavalcante, T. Finley, and S.H. Rodger. A visual and interactive theory course with jflap 4.0. In ACM SIGCSE '04, pages 140-144, 2004.
4. Carlos I. Chesñevar, María Laura Cobo, and William Yurcik. Using Theoretical Computer Simulators for Formal Languages and Automata Theory. ACM SIGCSE Bulletin, 35(2):33-37, 2003.
5. C.I. Chesnevar, M.P. Gonzalez, and A.G. Maguitman. Didactic strategies for promoting significant learning in formal languages and automata theory. In ACM ITiCSE '04, pages 7-11, 2004.
6. H. Comon, M. Dauchet, R. Gilleron, et al. Tree Automata Techniques and Applications, Available on the Web, 1999.
7. M. Dauchet. Simulation of turing machines by a regular rewrite rule. Theoretical Computer Science, 103:409-420, 1992. Also in RTA 1989.
8. N. Dershowitz and D. Plaisted. Rewriting. In J. A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume 1, chapter 9, pages 535-610. Elsevier Science, 2001.
9. A collection of Links to Finite State Machine software. http://www.csd.uwo.ca/research/grail/links.html.
10. Eric Gramond and Susan Rodger. Using JFLAP to interact with theorems in automata theory. ACM SIGCSE Bulletin, 31(1):336-340, 1999.
11. M.T. Grinder. Animating automata: A cross platform program for teaching automata. In ACM SIGCSE '02, pages 63-67, 2002.
12. M.T. Grinder. A preliminary empirical evaluation of the effectiveness of a finite state automaton animator. In ACM SIGCSE '03, pages 157-161, 2003.
13. M.T. Grinder, S.B. Kim, T.L. Lutey, et al. Loving to learn theory: Active learning modules for the theory of computing. In ACM SIGCSE '02, pages 371-375, 2002.
14. M. Hamada and K. Shiina. A classroom experiment for teaching automata. In ACM ITiCSE '04, pages 261-261, 2004.
15. O. Hazzan. Reducing abstraction level when learning computability theory concepts. In ACM ITiCSE '02, pages 156-160, 2002.
16. C.D. Hundhausen, S.A. Douglas, and J.T. Stasko. A meta-study of algorithm visualization effectiveness. Journal of Visual Languages and Computing, 13(3):259-290, 2002.
17. Ted Hung and Susan Rodger. Increasing visualization and interaction in the automata theory course. In ACM SIGCSE '00, pages 6-10, 2000.
18. H.R. Lewis and C.H. Papadimitriou. Elements of the theory of Computation. Prentice Hall, 1998.
19. M. Murata. "Hedge Automata: a Formal Model for XML Schemata". Web page, 1999. citeseer.nj.nec.com/murata99hedge.html.
20. T. Naps, G. Rossling, et al. Exploring the role of visualization and engagement in computer science education. Report of the Working Group on improving the educational impact of algorithm visualization. In ITICSE, 2002.
21. M. Robinson, J. Hamshar, J. Novillo, and A. Duchowski. A Java-based tool for reasoning about models of computation through simulating finite automata and turing machines. In ACM SIGCSE '99, 1999.
22. Susan Rodger, A. Bilska, K. Leider, et al. A collection of tools for making automata theory and formal languages come alive. ACM SIGCSE Bulletin, 29(1):15-19, 1997.
23. M. Sipser. Introduction to the Theory of Computation. PWS Publishing Co., 1997.
24. M. Vardi. Nontraditional applications of automata theory. In Theoretical Aspects of Computer Software, 1994.
25. 2: A laboratory for rapid term graph rewriting. In Proc. Conf. on Rewriting Techniques & Applications, pages 252-255, 1999.
26. R. Wilhelm and D. Maurer. Compiler Design. Addison Wesley, 1997.