A stack automaton is a pushdown automaton that can read the interior of its pushdown list without altering it.It is shown that a nondeterministic stack automation with a one-way input tape can be simulated by a deterministic linear bounded automaton. Hence, each nondeterministic one-way stack language is context sensitive
A 2-way sequential transducer is a 2-way finite acceptor to which an output structure has been added...
A 2-way sequential transducer is a 2-way finite acceptor to which an output structure has been added...
AbstractA generalization of pushdown automata towards regulated nondeterminism is studied. The nonde...
A stack automaton is a pushdown automaton that can read the interior of its pushdown list without al...
AbstractThe stack automaton has been recently introduced into the literature as a model for a compil...
AbstractA stack automaton is a pushdown automaton with the added privilege of scanning the contents ...
AbstractThe stack automaton has been recently introduced into the literature as a model for a compil...
International audienceWe introduce and investigate input-driven stack automata, which are a generali...
Deterministic 1-way stack automata (SA) are generalized to include jumps, and it is established that...
AbstractA stack automaton is a pushdown automaton with the added privilege of scanning the contents ...
AbstractWe present a relation between the sets accepted by two-way pushdown automataand certain tape...
AbstractThis paper introduces a new automaton, called a writing pushdown acceptor (abbreviated wpda)...
AbstractPushdown automata using a limited and unlimited amount of nondeterminism are investigated. M...
This note describes a special type of one-way, one-tape automata in the sense of Rabin and Scott tha...
AbstractPushdown automata using a limited and unlimited amount of nondeterminism are investigated. M...
A 2-way sequential transducer is a 2-way finite acceptor to which an output structure has been added...
A 2-way sequential transducer is a 2-way finite acceptor to which an output structure has been added...
AbstractA generalization of pushdown automata towards regulated nondeterminism is studied. The nonde...
A stack automaton is a pushdown automaton that can read the interior of its pushdown list without al...
AbstractThe stack automaton has been recently introduced into the literature as a model for a compil...
AbstractA stack automaton is a pushdown automaton with the added privilege of scanning the contents ...
AbstractThe stack automaton has been recently introduced into the literature as a model for a compil...
International audienceWe introduce and investigate input-driven stack automata, which are a generali...
Deterministic 1-way stack automata (SA) are generalized to include jumps, and it is established that...
AbstractA stack automaton is a pushdown automaton with the added privilege of scanning the contents ...
AbstractWe present a relation between the sets accepted by two-way pushdown automataand certain tape...
AbstractThis paper introduces a new automaton, called a writing pushdown acceptor (abbreviated wpda)...
AbstractPushdown automata using a limited and unlimited amount of nondeterminism are investigated. M...
This note describes a special type of one-way, one-tape automata in the sense of Rabin and Scott tha...
AbstractPushdown automata using a limited and unlimited amount of nondeterminism are investigated. M...
A 2-way sequential transducer is a 2-way finite acceptor to which an output structure has been added...
A 2-way sequential transducer is a 2-way finite acceptor to which an output structure has been added...
AbstractA generalization of pushdown automata towards regulated nondeterminism is studied. The nonde...