Pages that link to "Item:Q5286053"
From MaRDI portal
The following pages link to A fast algorithm to decide on the equivalence of stateless DPDA (Q5286053):
Displaying 6 items.
- Equivalence of simple functions (Q880171) (← links)
- A polynomial algorithm for deciding bisimilarity of normed context-free processes (Q1351456) (← links)
- Complete formal systems for equivalence problems (Q1575907) (← links)
- Pushdown automata, multiset automata, and Petri nets (Q5941098) (← links)
- Infinite results (Q6104374) (← links)
- Decidability results in automata and process theory (Q6560390) (← links)