Courcelle B. On jump deterministic pushdown automata.-- Math. Systems Theory, 1977. -- Vol. 11. -- P. 87--109.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....on the stack has to be erased at the same time. So, if we want to have a realtime device, this leads to use some mechanism that erases an unbounded number of topmost stack symbols in one step. Several such mechanisms have been introduced and studied in the literature (see e.g. Cole[11] Courcelle[12], Greibach[26] Nivat[41] Schutzenberger[48] We present now one such accepting device. A jump pdm over A is a 4 tuple A = Q; Z; J; T ) where Q and Z have the same meaning as in a pdm, and J is a new alphabet in bijection with Z, the elements of which are called jump stack symbols, or simply ....

B. Courcelle. On jump deterministic pushdown automata. Math. Systems Theory, 11:87--109, 1977.

....on the stack has to be erased at the same time. So, if we want to have a realtime device, this leads to use some mechanism that erases an unbounded number of topmost stack symbols in one step. Several such mechanisms have been introduced and studied in the literature (see e.g. Cole[11] Courcelle[12], Greibach[26] Nivat[41] Schutzenberger[48] We present now one such accepting device. A jump pdm over A is a 4 tuple A = Q; Z; J; T ) where Q and Z have the same meaning as in a pdm, and J is a new alphabet in bijection with Z, the elements of which are called jump stack symbols, or simply ....

B. Courcelle. On jump deterministic pushdown automata. Math. Systems Theory, 11:87--109, 1977.

No context found.

Courcelle B. On jump deterministic pushdown automata.-- Math. Systems Theory, 1977. -- Vol. 11. -- P. 87--109.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC