Automata Project PROBLEM  

Develop an animation for visualization of a One-Stack Automaton for processing a non-regular 
Context-Free Language such as L2 = {     {nc}n : where  n >= 0      } 

L2 has matching number of {'s and }'s. 
  
For two Extra Credit points, one can Develop an animation for visualization of a One-Stack Automaton 
for processing an additional non-regular Context-Free Language such as L3 = { anbn : where  n >= 0  } 

The animations can be developed using any of the languages or tools of your choice including 
(but not restricted to) Flash, Javascript, and Java.   

For an example of visualization, please follow the link given below:

  A Sample  Demo on Turing  Machine Visualization   
After you follow this link, select one of the two choices:  
 (1)  ab*    
    If you select this choice, then  type a string such as      abbbb 
    in the white editable input field and then click on the
    Process button. This machine accepts any string with one  a  
    followed by any number of  b's 

 (2) anbncn

    If you select this choice, then  type a string such as      aabbcc
    in the white editable input field and then click on the
    Process button. This machine accepts any string with equal number of  a's 
     b's  and   c's 
  
For questions and comments, please contact:
   
             Dr. Pradip Peter Dey,
             Professor,  School of Engineering and Technology
             National University
             3678 Aero Court, San Diego, CA 92123
             U.S.A.
             Phone: (858) 309-3421
             Fax (858) 309-3420    
             Email: pdey@nu.edu 
  
 

"We choose to go to the Moon in this decade and do the other things, not because they are easy, but because they are hard; because that goal will serve to organize and measure the best of our energies and skills, . . . "     - - - John F. Kennedy