Pages that link to "Item:Q3546360"

The following pages link to Undecidability of bisimilarity by defender's forcing (Q3546360):

Displaying 8 items.

• Theory of interaction (Q896903) (← links)
• On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
• Hardness of equivalence checking for composed finite-state systems (Q1015390) (← links)
• Equivalence of pushdown automata via first-order grammars (Q2208249) (← links)
• Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence (Q2301358) (← links)
• Selected Ideas Used for Decidability and Undecidability of Bisimilarity (Q3532999) (← links)
• (Q5111633) (← links)
• Countdown games, and simulation on (succinct) one-counter nets (Q5883735) (← links)