Pages that link to "Item:Q3479542"

The following pages link to Graphes canoniques de graphes algébriques (Q3479542):

Displaying 15 items.

• A general account of coinduction up-to (Q523132) (← links)
• On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
• A note on an expressiveness hierarchy for multi-exit iteration (Q1014386) (← links)
• A short proof of the decidability of bisimulation for normed BPA- processes (Q1198053) (← links)
• Decidability of bisimulation equivalence for normed pushdown processes (Q1276237) (← links)
• Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\) (Q1314379) (← links)
• A note on the complexity of deciding bisimilarity of normed unary processes (Q1331934) (← links)
• A polynomial algorithm for deciding bisimilarity of normed context-free processes (Q1351456) (← links)
• An equational axiomatization for multi-exit iteration (Q1369097) (← links)
• The complexity of bisimilarity-checking for one-counter processes. (Q1401395) (← links)
• Bisimulation and coinduction enhancements: a historical perspective (Q2280213) (← links)
• A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577) (← links)
• Decidability of performance equivalence for basic parallel processes (Q2503324) (← links)
• An experimental ambiguity detection tool (Q2653935) (← links)
• Reflections on a Geometry of Processes (Q5262964) (← links)