Some static and dynamic visualization of mathematical models are linked to this page for considerations in understanding computational aspects of these models. Static visualizations are often found in books and journals and therefore they are not emphasized here. The examples of dynamic visualizations (or animations) shown here are a part of an ongoing effort in visualization of all major mathematical models of computation.
Dynamic Visualization of a Turing Machine for
L1 = { aba* } = { ab, aba, abaa, abaaa, abaaaa, abaaaaa, . . . . } is
demonstrated with an input. Compare this with the static visualization given below.
Dynamic Visualization of a Turing Machine for
L2 = { anbnan : n > 0 } = { aba, aabbaa, aaabbbaaa, aaaabbbbaaaa, . . . }
Please try aabbaa as an input to this Turing Machine. It accepts any string with equal number of a's
b's and a's that is, a string with the pattern anbnan,
where n > 0. aabbaa will be accepted by this machine; but aabbaaaaa
will not be accepted.
Static Visualizaion of a Turing Machine can be seen following the link given below where a Turing Machine for L1 = { aba* } = { ab, aba, abaa, abaaa, abaaaa, abaaaaa, . . . . } is demonstated with an input.
Static Visualization of a Turing Machine
For questions and comments, please contact:
Dr. Pradip Peter Dey
School of Engineering, Technology and Media
National University
3678 Aero Court, San Diego, CA 92123
U.S.A.
Phone: (858) 309-3421
Fax (858) 309-3420
Email: pdey@nu.edu
Bibliography:
Cohen, D. (1997). Introduction to Computer Theory (2nd ed.), New York: John Wiley & Sons.
Hopcroft, J. E., Motwani, R. & Ullman, J. (2007). Introduction to Automata Theory,
Languages, and Computation. Pearson Education.
Kahneman, D. (2002). Maps of bounded rationality: A perspective on intuitive judgment and choice (Nobel Prize Lecture).
In Tore Frängsmyr, (ed.). Les Prix Nobel. The Nobel Prizes 2002, 416-499, Retrieved March 12, 2009 from
http://nobelprize.org/nobel_prizes/economics/laureates/2002/kahneman-lecture.html
Lowe, R. K. & Schnotz, W. (Eds) (2007) Learning with animation, New York: Cambridge University Press.
Tversky, B., Morrison, J. B., & Betrancourt, M. (2002). Animation: can it facilitate?. International
Journal of Human–Computer Studies, 57, 247–262.
Rich, E. ( 2007) Automata, Computability and Complexity: Theory and Applications
Rodger, S.H. (2006) Learning automata and formal languages interactively with JFLAP. ITiCSE 2006: 360
Rodger, S. H. & Finley, T. W. (2006). JFLAP: An Interactive Formal Languages and Automata Package. Jones & Bartlett Publishers.
Rodger, S.H., Bressler, B., Finley, T. & Reading, S. (2006). Turning automata theory into a
hands-on course. SIGCSE 2006: 379-383
Rodger, S.H., Eric Wiebe, Kyung Min Lee, Chris Morgan, Kareem Omar, Jonathan Su. (2009). Increasing
engagement in automata theory with JFLAP. SIGCSE 2009: 403-407
Sipser, M. (2006) Introduction to the Theory of Computation, PWS Publishing.
R. Gregory Taylor (1998) Models of Computation and Formal Languages, Oxford University Press.
Wong, A., Marcus, N., Paul Ayres, Lee Smith, Graham A. Cooper, Fred Paas and John Sweller (2009).
Instructional animations can be superior to statics when learning human motor skills, Computers
in Human Behavior, Volume 25, Issue 2, March 2009, Pages 339-34
Cyril Rebetez, Mireille Bétrancourt, Mirweis Sangin and Pierre Dillenbourg (2009). Learning
from animation enabled by collaboration. Instructional Science.
Richard E. Mayer and Roxana Moreno.(2002). Animation as an Aid to Multimedia Learning, Educational
Psychology Review, Volume 14, Number 1
Tsay, Y., Chen, Y., Tsai, M., Wu, K. & Chan, W. (2007). GOAL: A Graphical Tool for
Manipulating Büchi Automata and Temporal Formulae, in Tools and Algorithms for the
Construction and Analysis of Systems. Springer.
Tversky, B., Morrison, J. B., & Betrancourt, M. (2002). Animation: can it facilitate?.
International Journal of Human–Computer Studies, 57, 247–262.
Slide Presentation