Pages that link to "Item:Q1230509"
From MaRDI portal
The following pages link to A result on the equivalence problem for deterministic pushdown automata (Q1230509):
Displaying 16 items.
- New families of non real time dpda's and their decidability results (Q799385) (← links)
- An extended direct branching algorithm for checking equivalence of deterministic pushdown automata (Q801689) (← links)
- Some results on subclass containment problems for special classes of dpda's related to nonsingular machines (Q1060563) (← links)
- Superdeterministic DPDAs: The method of accepting does affect decision problems (Q1132642) (← links)
- The simultaneous accessibility of two configurations of two equivalent DPDA's (Q1152220) (← links)
- The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine (Q1158757) (← links)
- On the decidability of equivalence for deterministic pushdown transducers (Q1158772) (← links)
- DPDA's in 'Atomic normal form' and applications to equivalence problems (Q1158965) (← links)
- On equivalence and subclass containment problems for deterministic context-free languages (Q1251906) (← links)
- A note on non-singular deterministic pushdown automata (Q1252037) (← links)
- Two decidability results for deterministic pushdown automata (Q1254241) (← links)
- On equivalence of grammars through transformation trees (Q1259173) (← links)
- Decidability of the equivalence problem for deterministic pushdown automata (Q1816326) (← links)
- Synchronizable deterministic pushdown automata and the decidability of their equivalence (Q1822521) (← links)
- A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars (Q1838320) (← links)
- On jump-deterministic pushdown automata (Q4141220) (← links)
