Pages that link to "Item:Q3327736"
From MaRDI portal
The following pages link to A direct branching algorithm for checking equivalence of some classes of deterministic pushdown automata (Q3327736):
Displayed 7 items.
- 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)
- A direct branching algorithm for checking the equivalence of two deterministic pushdown transducers, one of which is real-time strict (Q1124364) (← links)
- A hierarchy of real-time deterministic languages and their equivalence (Q1165588) (← 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 extended equivalence problem for a class of non-real-time deterministic pushdown automata (Q1894681) (← links)