A Mezei-Wright theorem for categorical algebras
From MaRDI portal
Publication:1044831
DOI10.1016/j.tcs.2009.06.040zbMath1186.68244MaRDI QIDQ1044831
Publication date: 15 December 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.06.040
68Q45: Formal languages and automata
08A05: Structure theory of algebraic structures
18C10: Theories (e.g., algebraic theories), structure, and semantics
Related Items
A note on ordinal DFAs, The ordinal generated by an ordinal grammar is computable, ALGEBRAIC LINEAR ORDERINGS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recursion and iteration in continuous theories: the M-construction
- The category-theoretic solution of recursive program schemes
- Fundamental properties of infinite trees
- Algebraic semantics
- IO and OI. II
- Fixed-point constructions in order-enriched categories
- Equational elements in additive algebras
- Some remarks on finitary and iterative monads
- The equational theory of regular words
- Equational logic of circular data type specification
- Inductive \(^{*}\)-semirings
- Matrix and matricial iteration theories. I
- Final Coalgebras And a Solution Theorem for Arbitrary Endofunctors
- Regular and Algebraic Words and Ordinals
- Initial Algebra Semantics and Continuous Algebras
- Continuous Additive Algebras and Injective Simulations of Synchronization Trees
- Elgot Algebras
- Algebraic automata and context-free sets
