International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Completeness of Park induction
MFPS '94 Proceedings of the tenth conference on Mathematical foundations of programming semantics
Information and Computation
Axiomatizing the Equational Theory of Regular Tree Languages (Extended Anstract)
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Axiomatizing the Least Fixed Point Operation and Binary Supremum
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Definable Operation in General Algebras, and the Theory of Automata and Flowcharts
Programming Languages and Their Definition - Hans Bekic (1936-1982)
Complete Axioms for Categorical Fixed-Point Operators
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
An extension theorem with an application to formal tree series
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Rational algebraic theories and fixed-point solutions
SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
Kleene theorem in partial conway theories with applications
Algebraic Foundations in Computer Science
A Connection Between Concurrency and Language Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Iteration grove theories are iteration theories equipped with an additive structure satisfying certain one-sided distributivity laws. In any iteration grove theory, the fixed point operation determines and is determined by a generalized star operation that takes familiar form in many applications. We relate properties of the dagger operation to properties of the generalized star operation and present some applications to continuous functions over complete lattices, continuous monoids, and to tree languages.