Is this automata universal?

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


Date: 29 Dec 2003 16:20:37 -0800

Hi, I have a question about a type of stack automata if it is
universal.

you have a stack and you take the first symbol, delete it and put
0,1,2 symbols at the end of the stack. Is this automata universal?
Thanks
André Betz



Relevant Pages

  • 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: Is this automata universal?
    ... > Andre wrote: ... >> you have a stack and you take the first symbol, ...
    (comp.theory)