The following pages link to (Q4116078):
Displayed 50 items.
- Expressive power of typed and type-free programming languages (Q761790) (← links)
- Iterative factor algebras and induced metrics (Q790606) (← links)
- All solutions of a system of recursion equations in infinite trees and other contraction theories (Q791310) (← links)
- The category-theoretic solution of recursive program schemes (Q860876) (← links)
- Combining data type and recursive process specifications using projection algebras (Q910188) (← links)
- Algebraic specification of concurrent systems (Q914405) (← links)
- Deterministic finite automata with recursive calls and DPDAs (Q1014418) (← links)
- A Mezei-Wright theorem for categorical algebras (Q1044831) (← links)
- Fundamental properties of infinite trees (Q1055184) (← links)
- Rational set of trees and the algebraic semantics of logic programming (Q1055186) (← links)
- Order completion monads (Q1055871) (← links)
- On the Herbrand-Kleene universe for nondeterministic computations (Q1060011) (← links)
- Extended macro grammars and stack controlled machines (Q1064075) (← links)
- Macro tree transducers (Q1073576) (← links)
- On context-free trees (Q1082826) (← links)
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars (Q1098322) (← links)
- Full abstraction and limiting completeness in equational languages (Q1121676) (← links)
- Metric interpretations of infinite trees and semantics of non deterministic recursive programs (Q1136494) (← links)
- Partially additive categories and flow-diagram semantics (Q1137858) (← links)
- On the complexity of \(\omega\)-type Turing acceptors (Q1138912) (← links)
- Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. I (Q1143165) (← links)
- Varieties of chain-complete algebras (Q1145208) (← links)
- Recursion-closed algebraic theories (Q1157899) (← links)
- DPDA's in 'Atomic normal form' and applications to equivalence problems (Q1158965) (← links)
- Recognizable formal power series on trees (Q1164440) (← links)
- Graph grammars and operational semantics (Q1165029) (← links)
- Rewrite, rewrite, rewrite, rewrite, rewrite, \dots (Q1176247) (← links)
- Algebraic and fixed point equations over inverse limits of algebras (Q1177146) (← links)
- Completeness results for the equivalence of recursive schemas (Q1232171) (← links)
- IO and OI. I (Q1241985) (← links)
- IO and OI. II (Q1243578) (← links)
- On some classes of interpretations (Q1251892) (← links)
- Program transformations and algebraic semantics (Q1254849) (← links)
- Computing in unpredictable environments: semantics, reduction strategies, and program transformations (Q1389440) (← links)
- The equational logic of fixed points (Q1391734) (← links)
- \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
- A short scientific biography of Maurice Nivat (Q1605477) (← links)
- A unifying theorem for algebraic semantics and dynamic logics (Q1821095) (← links)
- Recursion induction principle revisited (Q1838286) (← links)
- Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable (Q2422040) (← links)
- Pushdown tree automata (Q3036724) (← links)
- (Q3336679) (← links)
- (Q3657459) (← links)
- (Q3665882) (← links)
- (Q3675498) (← links)
- Decidable subcases of the equivalence problem for recursive program schemes (Q3773319) (← links)
- Comparaison et équivalence de sémantiques pour les schémas de programmes non déterministes (Q3774922) (← links)
- Infinite trees in normal form and recursive equations having a unique solution (Q3851585) (← links)
- Formal computations of non deterministic recursive program schemes (Q3883492) (← links)
- (Q4139645) (← links)