The following pages link to Decidability of DPDA equivalence (Q5941060):
Displayed 19 items.
- Reducing behavioural to structural properties of programs with procedures (Q385023) (← links)
- Model-checking hierarchical structures (Q414908) (← links)
- Constructive semantics for instantaneous reactions (Q631753) (← links)
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- Decision problems for pushdown threads (Q884992) (← links)
- Compositional verification of sequential programs with procedures (Q937300) (← links)
- Deterministic finite automata with recursive calls and DPDAs (Q1014418) (← links)
- \(L(A)=L(B)\)? A simplified decidability proof. (Q1603704) (← links)
- Some decision problems concerning semilinearity and commutation. (Q1872706) (← links)
- An approach to deciding the observational equivalence of Algol-like languages (Q1886322) (← links)
- The Hennessy-Milner equivalence for continuous time stochastic logic with mu-operator (Q2372202) (← links)
- When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus (Q2643076) (← links)
- Inverse monoids: decidability and complexity of algebraic questions. (Q2643082) (← links)
- Bisimulation-based Non-deterministic Admissible Interference and its Application to the Analysis of Cryptographic Protocols (Q2841265) (← links)
- Model-Checking Games for Typed λ-Calculi (Q2864164) (← links)
- Modular Games for Coalgebraic Fixed Point Logics (Q2873663) (← links)
- A Propositional Dynamic Logic for CCS Programs (Q3511450) (← links)
- Selected Ideas Used for Decidability and Undecidability of Bisimilarity (Q3532999) (← links)
- A Complete Axiomatic System for a Process-Based Spatial Logic (Q3599152) (← links)