Pages that link to "Item:Q1132642"
From MaRDI portal
The following pages link to Superdeterministic DPDAs: The method of accepting does affect decision problems (Q1132642):
Displaying 11 items.
- On some decision questions concerning pushdown machines (Q593781) (← links)
- 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)
- 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)
- 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)
- The inclusion problem for some subclasses of context-free languages (Q1978515) (← links)
- Monoid-Based Approach to the Inclusion Problem on Superdeterministic Pushdown Automata (Q2817405) (← links)
