![]() Teachers act as facilitators not as knowledge transmitters. ![]() In designing our simulators, we considered the active construction learning model that has a number of basic design principles which include the following: 1. This makes them useful tools for interactive and online automata learning. Selection and peer review under responsibility of the organizers of the 2013 International Conference on Computational Science doi: /j.procsĢ Mohamed Hamada / Procedia Computer Science 18 ( 2013 ) Our simulators are written in Java language which implies that they are portable, machine independent and web-based enabled. Such courses cover a variety of topics including finite state automata, pushdown automata and Turing machines. Our approach can be used as a supporting tool for active learning not only for automata theory, but also for several other courses such as theory of computation, discrete mathematics, computational models, programming languages, compiler design and other related courses. Our simulators are designed to tackle this issue and meet the active learning preferences for computer engineering learners. Since computer engineering learners tend to have strong active preferences according to learning science research, a lecturedriven teaching style is less motivating for them. These concepts are abstract in nature and hence used to be taught by a traditional lecture-driven style, which is suitable for learners with reflective preferences. The concepts of automata theory, such as Turing machines and pushdown automata, have important use in designing and analysing computational models of several hardware and software applications. One of such mathematical models is automata theory. In practical use, it is typically the application of computer simulation and other forms of computation to problems in various scientific disciplines. Introduction Computational science is an interdisciplinary field in which mathematical models combined with scientific computing methods are used to study systems of real-world problems. Keywords: Finite automata, Pushdown automata, Turing machines, Simulators, Computational science. A preliminary evaluation shows the effectiveness of the simulators in classroom. ![]() The twofold contribution of this work is a novel use of modern technology to improve learning and a longitudinal experimental evaluation of its use in context. 1 Available online at Procedia Computer Science 18 (2013 ) International Conference on Computational Science, ICCS 2013 Turing Machine and Automata Simulators Mohamed Hamada Sofware Engineering Lab, The University of Aizu, Aizuwakamatsu, Fukushima,, Japan Abstract This paper introduces a Turing machine and pushdown automata simulators as a virtual environment for learning computational models and automata theory.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |