The following pages link to (Q4002149):
Displaying 24 items.
- Closure properties for the class of behavioral models (Q2373706) (← links)
- On the coset laws for skew lattices (Q2428566) (← links)
- Algebraic models of behaviour and correctness of SMT and CMT processors (Q2461762) (← links)
- Picture deformation (Q2480778) (← links)
- Algebraic recognizability of regular tree languages (Q2484441) (← links)
- A relational account of call-by-value sequentiality (Q2506495) (← links)
- Towards a proof of the decidability of the momentary stagnation of the growth function of D0L systems (Q2566011) (← links)
- Synchronized shuffles (Q2566012) (← links)
- The recognizability of sets of graphs is a robust property (Q2566292) (← links)
- Positive varieties of tree languages (Q2576866) (← links)
- Fuzzy Horn logic. I. Proof theory. (Q2580956) (← links)
- Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs (Q2802489) (← links)
- Factorization systems and fibrations (Q2842821) (← links)
- Equational Weighted Tree Transformations with Discounting (Q3098036) (← links)
- Recognizable sets of graphs: equivalent definitions and closure properties (Q4286529) (← links)
- (Q4389706) (← links)
- A short overview of Hidden Logic (Q4586416) (← links)
- Higher-order algebra with transfinite types (Q4645814) (← links)
- Parametric algebraic specifications with Gentzen formulas – from quasi-freeness to free functor semantics (Q4847312) (← links)
- Modal Rules are Co-Implications (Q4917041) (← links)
- Functional sorts in data type specifications (Q5055916) (← links)
- On the finite embeddability property for residuated ordered groupoids (Q5461379) (← links)
- Supervisory Control with Complete Observations (Q5496921) (← links)
- A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices (Q6154974) (← links)
