Group axioms for iteration
From MaRDI portal
Publication:1283821
DOI10.1006/inco.1998.2746zbMath0924.68143OpenAlexW2043871010WikidataQ114695457 ScholiaQ114695457MaRDI QIDQ1283821
Publication date: 30 March 1999
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1998.2746
Related Items
A connection between concurrency and language theory, THE POWER OF THE GROUP-IDENTITIES FOR ITERATION, Inductive \(^{*}\)-semirings, Axiomatizing the equational theory of regular tree languages, Left-Handed Completeness, Conway's work on iteration, Axiomatizing rational power series over natural numbers, An analysis of the equational properties of the well-founded fixed point, Axiomatizing the identities of binoid languages, Equational properties of iteration in algebraically complete categories, Free inductive \(K\)-semialgebras, Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview, Equational Properties of Stratified Least Fixed Points (Extended Abstract), Free iterative and iteration \(K\)-semialgebras, On the equational definition of the least prefixed point., Equational axioms associated with finite automata for fixed point operations in cartesian categories, Unnamed Item, Equational properties of fixed-point operations in cartesian categories: An overview, Iteration Semirings, Axiomatizing weighted synchronization trees and weighted bisimilarity, The variety of Kleene algebras with conversion is not finitely based, Rewriting on cyclic structures: Equivalence between the operational and the categorical description, Left-handed completeness, Dagger extension theorem, Traced Premonoidal Categories, Partial Conway and Iteration Semiring-Semimodule Pairs, Kleene Theorem in Partial Conway Theories with Applications, Group axioms for iteration, Equational theories for automata, A proof of the Krohn--Rhodes Decomposition Theorem, Unique, guarded fixed points in an additive setting, The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics, On equations for union-free regular languages, On the fine-structure of regular algebra, A Fully Equational Proof of Parikh's Theorem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Iterative algebras
- A complete inference system for a class of regular behaviours
- Independence of the equational axioms for iteration theories
- Equational properties of iteration in algebraically complete categories
- Unique fixed points vs. least fixed points
- A calculus of communicating systems
- Algebraic semantics
- Complete systems of \(\mathcal B\)-rational identities
- On the algebraic structure of rooted trees
- Group axioms for iteration
- A completeness theorem for Kleene algebras and the algebra of regular events
- Completeness of Park induction
- A proof of the Krohn--Rhodes Decomposition Theorem
- Predicate Transformer Semantics
- Solutions of the Iteration Equation and Extensions of the Scalar Iteration Operation
- Vector Iteration in Pointed Iterative Theories
- Initial Algebra Semantics and Continuous Algebras
- The logic of recursive equations
- Equational axioms for regular sets
- Solving polynomial fixed point equations
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
- Some quasi-varieties of iteration theories
