Add to ORKGWe show that the validity of Parikh's theorem for context-free languages depends only on a few equational properties of least pre-fixed points. Moreover, we exhibit an infinite basis of mu-term equations of continuous commutative idempotent semirings
We prove an analog of Parikh's theorem for weighted context-free grammars over commutative, idempot...
AbstractWe define and study Parikh slender languages and power series. A language is Parikh slender ...
The family RX∗ of regular subsets of the free monoid X∗ generated by a finite set X is the standard ...
We show that the validity of Parikh's theorem for context-free languages depends only on a few...
We show that the validity of Parikh's theorem for context-free languages depends only on a few equa...
We review the rudiments of the equational logic of (least) fixed points and provide some of its appl...
AbstractA strengthened form of the pumping lemma for context-free languages is used to give a simple...
We give inequational and equational axioms for semirings with a fixed-point operator and formally de...
AbstractWe give inequational and equational axioms for semirings with a fixed-point operator and for...
AbstractWe show that for several classes of idempotent semirings the least fixed-point of a polynomi...
AbstractIn this paper we first compare Parikh's condition to various pumping conditions — Bar-Hillel...
Parikh\u27s Theorem states that every context-free grammar (CFG) is equivalent to some regular CFG w...
AbstractWe give a finite equational axiomatization for +-free identities of (regular) languages whic...
AbstractThe paper generalizes the Ginsburg-Rice Schützenberger ALGOL-like fixed-point theorem showin...
In this paper we present a detailed proof of an important result of algebraic logic: namely that the...
We prove an analog of Parikh's theorem for weighted context-free grammars over commutative, idempot...
AbstractWe define and study Parikh slender languages and power series. A language is Parikh slender ...
The family RX∗ of regular subsets of the free monoid X∗ generated by a finite set X is the standard ...
We show that the validity of Parikh's theorem for context-free languages depends only on a few...
We show that the validity of Parikh's theorem for context-free languages depends only on a few equa...
We review the rudiments of the equational logic of (least) fixed points and provide some of its appl...
AbstractA strengthened form of the pumping lemma for context-free languages is used to give a simple...
We give inequational and equational axioms for semirings with a fixed-point operator and formally de...
AbstractWe give inequational and equational axioms for semirings with a fixed-point operator and for...
AbstractWe show that for several classes of idempotent semirings the least fixed-point of a polynomi...
AbstractIn this paper we first compare Parikh's condition to various pumping conditions — Bar-Hillel...
Parikh\u27s Theorem states that every context-free grammar (CFG) is equivalent to some regular CFG w...
AbstractWe give a finite equational axiomatization for +-free identities of (regular) languages whic...
AbstractThe paper generalizes the Ginsburg-Rice Schützenberger ALGOL-like fixed-point theorem showin...
In this paper we present a detailed proof of an important result of algebraic logic: namely that the...
We prove an analog of Parikh's theorem for weighted context-free grammars over commutative, idempot...
AbstractWe define and study Parikh slender languages and power series. A language is Parikh slender ...
The family RX∗ of regular subsets of the free monoid X∗ generated by a finite set X is the standard ...