Pages that link to "Item:Q1254241"
From MaRDI portal
The following pages link to Two decidability results for deterministic pushdown automata (Q1254241):
Displaying 11 items.
- On some decision questions concerning pushdown machines (Q593781) (← links)
- Propositional dynamic logic of nonregular programs (Q792083) (← links)
- An extended direct branching algorithm for checking equivalence of deterministic pushdown automata (Q801689) (← links)
- Learning efficiency of very simple grammars from positive data (Q1017659) (← links)
- Constructing a realtime deterministic pushdown automaton from a grammar (Q1051440) (← links)
- Superdeterministic DPDAs: The method of accepting does affect decision problems (Q1132642) (← 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)
- On equivalence of grammars through transformation trees (Q1259173) (← 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)
