The equivalence problem is decidable for deterministic real-time pushdown store automata accepting by empty stack. Further, the equivalence problem is decidable for two deterministic pushdown store automata, one of which is real-time accepting by empty stack
AbstractAn infinite hierarchy of real-time deterministic context free languages is introduced. It sp...
AbstractThis paper extends the direct branching algorithm of [25] for checking equivalence of determ...
If M is a realtime deterministic pushdown store acceptor, the language L(M) accepted by M by final s...
This paper shows that it is decidable whether or not two deterministic pushdownautomata, one of whic...
The equivalence problem is decidable for deterministic real-time pushdown store automata accepting b...
AbstractA real-time deterministic pushdown automaton is said to be stack uniform if for each input l...
It is proved that there is an algorithm for deciding whether two deterministic stateless pushdown au...
A context-free language is said to be simple if it is accepted by a single-state deterministic pushd...
AbstractAn infinite hierarchy of real-time deterministic context free languages is introduced. It sp...
This paper shows that it is decidable whether or not two deterministic pushdownautomata, one of whic...
AbstractA new direct branching algorithm is presented for checking the equivalence of deterministic ...
AbstractThe equivalence problem for deterministic pushdown automata is shown to be decidable. We exh...
AbstractA real-time deterministic pushdown automaton is said to be stack uniform if for each input l...
A context-free language is said to be real-time strict if it is accepted by a real-time deterministi...
A new direct algorithm is presented for checking equivalence of some classes of deterministic pushdo...
AbstractAn infinite hierarchy of real-time deterministic context free languages is introduced. It sp...
AbstractThis paper extends the direct branching algorithm of [25] for checking equivalence of determ...
If M is a realtime deterministic pushdown store acceptor, the language L(M) accepted by M by final s...
This paper shows that it is decidable whether or not two deterministic pushdownautomata, one of whic...
The equivalence problem is decidable for deterministic real-time pushdown store automata accepting b...
AbstractA real-time deterministic pushdown automaton is said to be stack uniform if for each input l...
It is proved that there is an algorithm for deciding whether two deterministic stateless pushdown au...
A context-free language is said to be simple if it is accepted by a single-state deterministic pushd...
AbstractAn infinite hierarchy of real-time deterministic context free languages is introduced. It sp...
This paper shows that it is decidable whether or not two deterministic pushdownautomata, one of whic...
AbstractA new direct branching algorithm is presented for checking the equivalence of deterministic ...
AbstractThe equivalence problem for deterministic pushdown automata is shown to be decidable. We exh...
AbstractA real-time deterministic pushdown automaton is said to be stack uniform if for each input l...
A context-free language is said to be real-time strict if it is accepted by a real-time deterministi...
A new direct algorithm is presented for checking equivalence of some classes of deterministic pushdo...
AbstractAn infinite hierarchy of real-time deterministic context free languages is introduced. It sp...
AbstractThis paper extends the direct branching algorithm of [25] for checking equivalence of determ...
If M is a realtime deterministic pushdown store acceptor, the language L(M) accepted by M by final s...
DOI
Add to ORKG