Daniela Chudá
ABSTRACT
Software simulation tools supporting a teaching process are highly accepted by both teachers and students. We discuss the possibility of using automata simulators in theoretical computer science courses. The main purpose of this article is to propose key features and requirements of well designed automata simulator and to present our tool SimStudio -- integrated simulator of finite automaton, pushdown automaton, Turing machine, RAM with extension and abacus machine. The aim of this paper is to report our experiences with using of our automata simulators in teaching of the course "Fundamentals of Theoretical Computer Science" in bachelor educational program in software engineering held at Faculty of Informatics and Information Technologies, Slovak University of Technology in Bratislava.
- Čerňanský, M., M. Nehéz, D. Chudá, I. Polický. On Using of Turing Machine Simulators in Teaching of Theoretical Computer Science, Aplimat - Journal of Applied Mathematics, 1, No. 2 (2008), Bratislava: SUT, pp. 301--312.Google Scholar
- Chudá, D.: Visualization in Education of Theoretical Computer Science, In Proceedings of the International Conference on Computer Systems and Technologies and Workshop for PhD Students in computing, Avantgard Print Ltd. Rousse, Bulgaria, 2007. ISBN 978-954-9641-50-9 Google ScholarDigital Library
- Chudá, D., Nehéz, M., and Čerňanský, M. 2009. On using of random access machine simulators in teaching of theoretical computer science. In Proceedings of the international Conference on Computer Systems and Technologies and Workshop For PhD Students in Computing (Ruse, Bulgaria, June 18--19, 2009). B. Rachev and A. Smrikarov, Eds. CompSysTech '09, vol. 433. ACM, New York, NY, 1--6. Google ScholarDigital Library
- Gruska, J. Foundations of Computing. Boston: International Thomson Computer Press, 1997. Google ScholarDigital Library
- Rodger, S. H., Lim, J., and Reading, S.: Increasing Interaction and Support in the Formal Languages and Automata Theory Course, In: The 12th Annual Conference on Innovation and Technology in Computer Science Education (ITiCSE 2007), p. 58--62, 2007. Google ScholarDigital Library
- Rodger, S. H., T. W. FINLEY: JFLAP: An Interactive Formal Languages and Automata Package, ISBN 0763738344, Jones & Bartlett Publishers, Inc., 2006. Google ScholarDigital Library
- Rodina, D.: Turing Machine Simulator. In: Student Research Conference 2008. 4th Student Research Conference in Informatics and Information Technologies Bratislava, April 30, 2008: Proceedings in Informatics and Information Technologies. FIIT STU, Bratislava, (2008), pp. 287--294.Google Scholar
- Rodina, D. Random Access Machine Simulator with Extensions. Student Research Conference 2009. 5th Student Research Conference in Informatics and Information Technologies Bratislava, Proceedings in Informatics and Information Technologies. FIIT STU, Bratislava, 2009, pp. 287x--294x.Google Scholar
- Szkup, L: Implementation of Abstract Computation Model - RAM Machine, Wrocław, 2006, {Online; accessed February 21st, 2009}. Available at: http://www.szkup.com/download/MaszynaRAM.pdf.Google Scholar
- Turing machine implemented in JavaScript. {Online} {2009/11/10} http://www.turing.org.uk/turing/scrapbook/tmjava.html.Google Scholar
- xTuringMachine Lab. {Online} {2009/10/10} http://math.hws.edu/TMCM/java/labs/xTuringMachineLab.html.Google Scholar
- Turing Machine Simulator v.0.3.1. {Online} http://www.jklm.no/tms/Google Scholar
Recommendations
Descriptional complexity of limited automata
A k-limited automaton is a linear bounded automaton that may rewrite each tape cell only in the first k visits, where k0 is a fixed constant. It is known that these automata accept context-free languages only. We investigate the descriptional complexity ...
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 ...
On the power of quantum finite state automata
FOCS '97: Proceedings of the 38th Annual Symposium on Foundations of Computer ScienceIn this paper, we introduce 1-way and 2-way quantum finite state automata (1qfa's and 2qfa's), which are the quantum analogues of deterministic, nondeterministic and probabilistic 1-way and 2-way finite state automata. We prove the following facts ...
Comments