One-Stack Automata   Animation     by Pradip Peter Dey et al
One-stack automata are acceptors of context-free languages; these are equivalent to Pushdown Automata which are well known in automata theory. A one-stack automaton for a non-regular Context-Free Language L2 = { anbn : where n >= 0 } is shown in action with an input string "aaabbb" . Press the START_ANIMATION button for invoking the animation. The machine starts execution from the start state marked by the - sign. The moving arrow shows the execution path and the underlined input symbol shows the current symbol being processed. Context-Free Language acceptors use a stack to check matching number of symbols in two substrings; they are not allowed to count directly.

If your browser blocks the animation, please allow the execution of the Java applet.
For more on one-stack automata,

A One-Stack Automaton for     { anbn : where n >=0 } = { ^, ab, aabb, aaabbb, . . . }
   
For more on One-Stack Automata Please click Here! .
For a Word document on One-Stack Automata   Please click Here!

For a published article on One-Stack Automata in PDF format Please click Here! .

 
Visitation number 4874 .     Thank you for visiting this page!

Please provide your comments on One-Stack Automata

You are requested to fill out every field; however, a partially filled out form is also accepted. That is, every field is optional.

- - - - - - - - - -
 		 - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
 
First Name
Middle Name
Last Name
Email Address
Are you a student? (Yes/No plus comments)
Are One-Stack Automata easy to learn? (Yes/No/Not Sure plus comments)
Are they easy augmentation of FA/NFA (Yes/No/Not Sure plus comments)
Do One-Stack Automata help in learning CF Language processing?
Any other comments?