Pages that link to "Item:Q598202"
From MaRDI portal
The following pages link to Nested semantics over finite trees are equationally hard (Q598202):
Displaying 13 items.
- Ready to preorder: an algebraic and general proof (Q843212) (← links)
- Bisimilarity is not finitely based over BPA with interrupt (Q860878) (← links)
- On finite alphabets and infinite bases (Q924717) (← links)
- Finding compact scheme forests in nested normal form is NP-hard (Q1322463) (← links)
- A linear-time-branching-time spectrum for behavioral specification theories (Q2291820) (← links)
- Nested semantics over finite trees are equationally hard (invited talk) (Q2847402) (← links)
- A Linear-Time–Branching-Time Spectrum of Behavioral Specification Theories (Q2971124) (← links)
- The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem (Q3540194) (← links)
- On Finite Bases for Weak Semantics: Failures Versus Impossible Futures (Q3599070) (← links)
- (Q5028469) (← links)
- (Q5089283) (← links)
- Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences (Q5415615) (← links)
- Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction (Q6163879) (← links)