Re: Is this automata universal?

From: Andre (sky4walk_at_gmx.de)
Date: 12/30/03 

Date: 30 Dec 2003 02:46:22 -0800

taati@dpir.com (Siamak) wrote in message news:<cf89d01f.0312292246.2ae10c26@posting.google.com>...
> Andre wrote:
> > you have a stack and you take the first symbol, delete it and put
> > 0,1,2 symbols at the end of the stack.
>
> Could you explain more what you mean?

e.g. you have a stack like this

c
b
a

and the following rules (add 0,1,2 symbols)

a->bc
b->c
c->

than the stack machine works like that

     c
c b c
b c b c
a -> b -> c -> b -> ...

it deletes the symbol from the bottom of the stack and put the new
symbols at the top of the stack.

So, is this machine universal?

Thanks
André Betz

Relevant Pages

  • Re: Programming for Electronics Engineers
    ... In message, Paul Burke ... stack balancing becomes second nature. ... Forth on a stack machine is a thing of beauty. ... C works as a reasonable assembler, but whoever thought up the use of = ...
    (sci.electronics.design)
  • Re: Is this automata universal?
    ... sky4walk@gmx.de (Andre) writes: ... > e.g. you have a stack like this ... is no stronger than this. ...
    (comp.theory)
  • how to deal with FOR
    ... In the source language, there is for statement and the rule is like ... I think I should put them on the stack like i, ... assembler as a stack machine) how could I know the address of them in ... their future use, for example, to compare whether i> 9. ...
    (comp.lang.asm.x86)
  • Re: Is this automata universal?
    ... >you have a stack and you take the first symbol, ... >0,1,2 symbols at the end of the stack. ... exercise 99 in Dexter Kozen's book "Automata and Computability". ...
    (comp.theory)
  • Re: Swapping two variables
    ... Andre> procedure to do it. ... Your code fragment shows that you're still not "thinking in Postscript". ... The stack is a nice place to store temp. ... and much cleaner for stack-oriented languages. ...
    (comp.lang.postscript)