Pages that link to "Item:Q1169813"

The following pages link to Regular trees and the free iterative theory (Q1169813):

Displaying 25 items.

• Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets (Q328657) (← links)
• How iterative reflections of monads are constructed (Q384934) (← links)
• Iterative and recursive matrix theories (Q595766) (← links)
• Equational properties of iterative monads (Q618163) (← links)
• On second-order iterative monads (Q639639) (← links)
• The solutions of two star-height problems for regular trees (Q760212) (← links)
• Iterative factor algebras and induced metrics (Q790606) (← links)
• Extensions of iterative congruences of free iterative algebras (Q792751) (← links)
• Implementation of data types by algebraic methods (Q792753) (← links)
• Deterministic and nondeterministic flowchart interpretations (Q796975) (← links)
• Bases for parametrized iterativity (Q1004388) (← links)
• Fundamental properties of infinite trees (Q1055184) (← links)
• On flowchart theories. I. The deterministic case (Q1093364) (← links)
• Algebraic solutions to recursion schemes (Q1098617) (← links)
• Recursion-closed algebraic theories (Q1157899) (← links)
• DPDA's in 'Atomic normal form' and applications to equivalence problems (Q1158965) (← links)
• The equational logic of fixed points (Q1391734) (← links)
• A new foundation for finitary corecursion and iterative algebras (Q2304521) (← links)
• Base modules for parametrized iterativity (Q2435311) (← links)
• Algebras with parametrized iterativity (Q2464938) (← links)
• Terminal coalgebras and free iterative theories (Q2500475) (← links)
• Elgot Theories: A New Perspective of Iteration Theories (Extended Abstract) (Q2805168) (← links)
• Recursive Program Schemes and Context-Free Monads (Q2919447) (← links)
• Elgot theories: a new perspective on the equational properties of iteration (Q3005993) (← links)
• Rewriting on cyclic structures: Equivalence between the operational and the categorical description (Q4943554) (← links)