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 µ-term equations of continuous commutative idempotent semirings
We give inequational and equational axioms for semirings with a fixed-point operator and formally de...
AbstractWe show that for several classes of idempotent semirings the least fixed-point of a polynomi...
We give a natural complete infinitary axiomatization of the equational theory of the context-free la...
We show that the validity of Parikh's theorem for context-free languages depends only on a few equa...
We show that the validity of Parikh's theorem for context-free languages depends only on a few equat...
AbstractWe give inequational and equational axioms for semirings with a fixed-point operator and for...
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...
AbstractIn this paper we first compare Parikh's condition to various pumping conditions — Bar-Hillel...
AbstractThe operation of nested iterated substitution preserves languages with the semilinear proper...
AbstractWe prove that the complement of a commutative languageLis context-free if the Parikh-map ofL...
AbstractWe define and study Parikh slender languages and power series. A language is Parikh slender ...
It is proved that every bounded context-free language L is commutatively equivalent to a regular lan...
Abstract. We show a new and constructive proof of the following language-theoretic result: for every...
We give a natural complete infinitary axiomatization of the equational theory of the context-free la...
We give inequational and equational axioms for semirings with a fixed-point operator and formally de...
AbstractWe show that for several classes of idempotent semirings the least fixed-point of a polynomi...
We give a natural complete infinitary axiomatization of the equational theory of the context-free la...
We show that the validity of Parikh's theorem for context-free languages depends only on a few equa...
We show that the validity of Parikh's theorem for context-free languages depends only on a few equat...
AbstractWe give inequational and equational axioms for semirings with a fixed-point operator and for...
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...
AbstractIn this paper we first compare Parikh's condition to various pumping conditions — Bar-Hillel...
AbstractThe operation of nested iterated substitution preserves languages with the semilinear proper...
AbstractWe prove that the complement of a commutative languageLis context-free if the Parikh-map ofL...
AbstractWe define and study Parikh slender languages and power series. A language is Parikh slender ...
It is proved that every bounded context-free language L is commutatively equivalent to a regular lan...
Abstract. We show a new and constructive proof of the following language-theoretic result: for every...
We give a natural complete infinitary axiomatization of the equational theory of the context-free la...
We give inequational and equational axioms for semirings with a fixed-point operator and formally de...
AbstractWe show that for several classes of idempotent semirings the least fixed-point of a polynomi...
We give a natural complete infinitary axiomatization of the equational theory of the context-free la...