Pages that link to "Item:Q6104375"

The following pages link to Decidability of bisimulation equivalence for normed pushdown processes (Q6104375):

Displaying 3 items.

• \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
• The equivalence problem for deterministic pushdown automata is decidable (Q4571996) (← links)
• Pushdown automata, multiset automata, and Petri nets (Q5941098) (← links)