The equivalence problem for deterministic finite-turn pushdown automata

Cited in

(57)

On the power of deep pushdown stacks
Fundamental properties of infinite trees
Some results on subclass containment problems for special classes of dpda's related to nonsingular machines
The equivalence and inclusion problems for NTS languages
On deciding the confluence of a finite string-rewriting system on a given congruence class
Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages
A polynomial algorithm testing partial confluence of basic semi-Thue systems
Superdeterministic DPDAs: The method of accepting does affect decision problems
A representation of trees by languages. II
The complexity of decision problems for finite-turn multicounter machines
The simultaneous accessibility of two configurations of two equivalent DPDA's
The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine
On the decidability of equivalence for deterministic pushdown transducers
DPDA's in 'Atomic normal form' and applications to equivalence problems
Tree equivalence of linear recursive schemata is polynomial-time decidable
A result on the equivalence problem for deterministic pushdown automata
An improvement on Valiant's decision procedure for equivalence of deterministic finite turn pushdown machines
A representation of trees by languages. I
On equivalence and subclass containment problems for deterministic context-free languages
Two decidability results for deterministic pushdown automata
On equivalence of grammars through transformation trees
Synchronized tree automata
The tree equivalence of linear recursion schemes
\(L(A)=L(B)\)? decidability results from complete formal systems
\(L(A)=L(B)\)? A simplified decidability proof.
Decidability of the equivalence problem for deterministic pushdown automata
Synchronizable deterministic pushdown automata and the decidability of their equivalence
A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars
Problems of inclusion and equivalence for program schemata and formal languages
Deterministic input-driven queue automata: finite turns, decidability, and closure properties
Program equivalence checking by two-tape automata
Equivalence of deterministic pushdown automata revisited
The equivalence problem for real-time deterministic pushdown automata
It is decidable whether a monadic thue system is canonical over a regular set
Decidable subcases of the equivalence problem for recursive program schemes
Restricted one-counter machines with undecidable universe problems
Conjunctive and Boolean grammars: the true general case of the context-free grammars
scientific article; zbMATH DE number 3776892 (Why is no real title available?)
The equivalence of pre-NTS grammars is decidable
The equivalence problem for deterministic pushdown automata is decidable
Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
Rational and Recognisable Power Series
On the equivalence problem for deterministic multitape automata and transducers
Queue Automata: Foundations and Developments
A fast algorithm to decide on the equivalence of stateless DPDA
HDTOL matching of computations of multitape automata
On some decision questions concerning pushdown machines
Formal grammars for turn-bounded deterministic context-free languages
Decidability of equivalence for deterministic synchronized tree automata
An algebraic approach to the equivalence checking of deterministic top-down tree transducers
New families of non real time dpda's and their decidability results
An extended direct branching algorithm for checking equivalence of deterministic pushdown automata
The equivalence problem of multitape finite automata
Decision problems for pushdown threads
Some decision problems about controlled rewriting systems
About the descriptive power of certain classes of finite string-rewriting systems
New techniques for proving the decidability of equivalence problem

This page was built for publication: The equivalence problem for deterministic finite-turn pushdown automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4772713)