Pages that link to "Item:Q4571996"
From MaRDI portal
The following pages link to The equivalence problem for deterministic pushdown automata is decidable (Q4571996):
Displayed 11 items.
- Deterministic finite automata with recursive calls and DPDAs (Q1014418) (← links)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q1127336) (← links)
- Complete formal systems for equivalence problems (Q1575907) (← links)
- Frontier between decidability and undecidability: A survey (Q1575913) (← links)
- \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
- \(L(A)=L(B)\)? A simplified decidability proof. (Q1603704) (← links)
- Decidability of bisimilarity for one-counter processes. (Q1854338) (← links)
- Equivalence of deterministic pushdown automata revisited (Q2458041) (← links)
- On composition and lookahead delegation of \(e\)-services modeled by automata (Q2566017) (← links)
- Decidability of DPDA equivalence (Q5941060) (← links)
- Pushdown automata, multiset automata, and Petri nets (Q5941098) (← links)