Bases for parametrized iterativity

DOI10.1016/j.ic.2008.05.002zbMath1160.18003OpenAlexW2090818170MaRDI QIDQ1004388

Jiří Velebil, Jiří Adámek, Stefan Milius

Publication date: 4 March 2009

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2008.05.002

zbMATH Keywords

locally presentable categorymonaditerative algebraiterative theoryparametrized signature

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Theories (e.g., algebraic theories), structure, and semantics (18C10) Categories of machines, automata (18B20)

Related Items (3)

Base modules for parametrized iterativity ⋮ Unnamed Item ⋮ Complete Elgot monads and coalgebraic resumptions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads
• Iterative algebras
• Fundamental properties of infinite trees
• Unique fixed points vs. least fixed points
• Regular trees and the free iterative theory
• Algebras with parametrized iterativity
• Terminal coalgebras and free iterative theories
• Coequalizers and free triples
• Iterative algebras at work
• A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on
• Generalizing Substitution
• A Perspective View of Discrete Automata and Their Design

This page was built for publication: Bases for parametrized iterativity