Add to ORKGWe review the rudiments of the equational logic of (least) fixed points and provide some of its applications for axiomatization problems with respect to regular languages, tree languages, and synchronization trees
We show that the validity of Parikh's theorem for context-free languages depends only on a few equa...
AbstractWe define a class of monotonic functions whose least fixed points are weakly definable in th...
AbstractThe mathematical semantics of programming languages is based largely on certain algebraic st...
We show that the validity of Parikh's theorem for context-free languages depends only on a few equat...
AbstractWe show that for several classes of idempotent semirings the least fixed-point of a polynomi...
AbstractWe show that a finite set of equation schemes together with the least fixed point rule gives...
AbstractThe paper generalizes the Ginsburg-Rice Schützenberger ALGOL-like fixed-point theorem showin...
We show that the validity of Parikh's theorem for context-free languages depends only on a few...
We give inequational and equational axioms for semirings with a fixed-point operator and formally de...
The papers included in this special issue are among the more representative ones presented at the w...
This paper deals with equations whose solutions are vectors of languages. Formally, solutions of equ...
AbstractWe study a generalization of DT0L systems obtained by considering noncommutative polynomials...
AbstractWe give inequational and equational axioms for semirings with a fixed-point operator and for...
We develop a fixed-point extension of quantitative equational logic and give semantics in one-bounde...
AbstractThe aim of this paper is to compare two approaches to the semantics of programming languages...
We show that the validity of Parikh's theorem for context-free languages depends only on a few equa...
AbstractWe define a class of monotonic functions whose least fixed points are weakly definable in th...
AbstractThe mathematical semantics of programming languages is based largely on certain algebraic st...
We show that the validity of Parikh's theorem for context-free languages depends only on a few equat...
AbstractWe show that for several classes of idempotent semirings the least fixed-point of a polynomi...
AbstractWe show that a finite set of equation schemes together with the least fixed point rule gives...
AbstractThe paper generalizes the Ginsburg-Rice Schützenberger ALGOL-like fixed-point theorem showin...
We show that the validity of Parikh's theorem for context-free languages depends only on a few...
We give inequational and equational axioms for semirings with a fixed-point operator and formally de...
The papers included in this special issue are among the more representative ones presented at the w...
This paper deals with equations whose solutions are vectors of languages. Formally, solutions of equ...
AbstractWe study a generalization of DT0L systems obtained by considering noncommutative polynomials...
AbstractWe give inequational and equational axioms for semirings with a fixed-point operator and for...
We develop a fixed-point extension of quantitative equational logic and give semantics in one-bounde...
AbstractThe aim of this paper is to compare two approaches to the semantics of programming languages...
We show that the validity of Parikh's theorem for context-free languages depends only on a few equa...
AbstractWe define a class of monotonic functions whose least fixed points are weakly definable in th...
AbstractThe mathematical semantics of programming languages is based largely on certain algebraic st...