Pages that link to "Item:Q3777488"
From MaRDI portal
The following pages link to The equivalence problem for real-time DPDAs (Q3777488):
Displayed 9 items.
- Some decision problems about controlled rewriting systems (Q910246) (← links)
- New techniques for proving the decidability of equivalence problem (Q913523) (← links)
- Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages (Q1120292) (← links)
- \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
- \(L(A)=L(B)\)? A simplified decidability proof. (Q1603704) (← links)
- The extended equivalence problem for a class of non-real-time deterministic pushdown automata (Q1894681) (← links)
- Problems of inclusion and equivalence for program schemata and formal languages (Q1895011) (← links)
- Equivalence of deterministic pushdown automata revisited (Q2458041) (← links)
- Decidable subcases of the equivalence problem for recursive program schemes (Q3773319) (← links)