AbstractThe equational class generated by rational algebraic theories was characterized in Esik, Comput. Linguistics and Comput. Languages XIV (1980), 183–207. Here, this class will be called the class of iteration theories. Also, there is a close connection between Elgot's iterative theories and iteration theories. In this paper we introduce algebras for iteration theories, called iteration algebras. Iteration algebras are natural generalization of regular algebras and they are closely related to iterative algebras as well. It is shown that the absolutely free iteration algebras are the algebras of regular trees
AbstractWe show that three fixed point structures equipped with (sequential) composition, a sum oper...
In “Monadic Computation and Iterative Algebraic Theories” Elgot [3] introduced the notion of a vecto...
Abstract. Iteration exists extensively in the nature. Iteration of a homeo-morphism generates a dyna...
AbstractThe equational class generated by rational algebraic theories was characterized in Esik, Com...
“In the setting of algebraic theories enriched with an external fixed-point operation, the no-tion o...
Iterative theories introduced by Calvin Elgot formalize potentially infinite computations as solu-ti...
In “Monadic Computation and Iterative Algebraic Theories” by Calvin C. Elgot,the notion “iterative t...
AbstractThis paper establishes the relationship between regular trees, equationally defined trees, a...
AbstractIterative theories introduced by Calvin Elgot formalize potentially infinite computations as...
AbstractMatrix iteration theories are characterized by identities using theory operations as well as...
Iterative theories, which were introduced by Calvin Elgot, formalise potentially infinite computatio...
We associate an identity with every finite automaton and show that a set of equations consiting of s...
AbstractThis paper extends Part 1 of the paper with the same title. Here, matricial iteration theori...
We develop a typed equational system that subsumes both iteration theories and typed Kleene algebra ...
AbstractWe prove the following completeness theorem: If the fixed point operation over a category is...
AbstractWe show that three fixed point structures equipped with (sequential) composition, a sum oper...
In “Monadic Computation and Iterative Algebraic Theories” Elgot [3] introduced the notion of a vecto...
Abstract. Iteration exists extensively in the nature. Iteration of a homeo-morphism generates a dyna...
AbstractThe equational class generated by rational algebraic theories was characterized in Esik, Com...
“In the setting of algebraic theories enriched with an external fixed-point operation, the no-tion o...
Iterative theories introduced by Calvin Elgot formalize potentially infinite computations as solu-ti...
In “Monadic Computation and Iterative Algebraic Theories” by Calvin C. Elgot,the notion “iterative t...
AbstractThis paper establishes the relationship between regular trees, equationally defined trees, a...
AbstractIterative theories introduced by Calvin Elgot formalize potentially infinite computations as...
AbstractMatrix iteration theories are characterized by identities using theory operations as well as...
Iterative theories, which were introduced by Calvin Elgot, formalise potentially infinite computatio...
We associate an identity with every finite automaton and show that a set of equations consiting of s...
AbstractThis paper extends Part 1 of the paper with the same title. Here, matricial iteration theori...
We develop a typed equational system that subsumes both iteration theories and typed Kleene algebra ...
AbstractWe prove the following completeness theorem: If the fixed point operation over a category is...
AbstractWe show that three fixed point structures equipped with (sequential) composition, a sum oper...
In “Monadic Computation and Iterative Algebraic Theories” Elgot [3] introduced the notion of a vecto...
Abstract. Iteration exists extensively in the nature. Iteration of a homeo-morphism generates a dyna...