AbstractWe define and study Parikh slender languages and power series. A language is Parikh slender if the number of words in the language with the same Parikh vector is bounded from above. As an application we get a new method for ambiguity proofs of context-free languages and a new proof of an earlier result of Autebert, Flajolet, and Gabarro concerning prefixes of infinite words
AbstractThe paper investigates languages containing at most one word of every length, or a number of...
AbstractWe prove that every slender context-free language is a union of paired loops, thus confirmin...
International audienceWe investigate the connection between properties of formal languages and prope...
AbstractWe define and study Parikh slender languages and power series. A language is Parikh slender ...
AbstractIn a recent paper we defined and studied Parikh slender languages and showed that they can b...
AbstractIn a recent paper we introduced Parikh slender languages as a generalization of slender lang...
In a recent paper we introduced Parikh slender languages and series as a generalization of slender l...
AbstractWe prove that every slender context-free language is a union of paired loops, thus confirmin...
AbstractWe present a classification of slender 0L languages into four classes and give decision meth...
AbstractThe paper investigates languages containing at most one word of every length, or a number of...
AbstractIn this paper we investigate languages containing at most a bounded number of words of each ...
AbstractWe investigate languages, where the number of words of every length is bounded from above by...
AbstractIn this paper we investigate languages containing at most a bounded number of words of each ...
We investigate the connection between properties of formal languages and properties of their generat...
AbstractWe investigate languages, where the number of words of every length is bounded from above by...
AbstractThe paper investigates languages containing at most one word of every length, or a number of...
AbstractWe prove that every slender context-free language is a union of paired loops, thus confirmin...
International audienceWe investigate the connection between properties of formal languages and prope...
AbstractWe define and study Parikh slender languages and power series. A language is Parikh slender ...
AbstractIn a recent paper we defined and studied Parikh slender languages and showed that they can b...
AbstractIn a recent paper we introduced Parikh slender languages as a generalization of slender lang...
In a recent paper we introduced Parikh slender languages and series as a generalization of slender l...
AbstractWe prove that every slender context-free language is a union of paired loops, thus confirmin...
AbstractWe present a classification of slender 0L languages into four classes and give decision meth...
AbstractThe paper investigates languages containing at most one word of every length, or a number of...
AbstractIn this paper we investigate languages containing at most a bounded number of words of each ...
AbstractWe investigate languages, where the number of words of every length is bounded from above by...
AbstractIn this paper we investigate languages containing at most a bounded number of words of each ...
We investigate the connection between properties of formal languages and properties of their generat...
AbstractWe investigate languages, where the number of words of every length is bounded from above by...
AbstractThe paper investigates languages containing at most one word of every length, or a number of...
AbstractWe prove that every slender context-free language is a union of paired loops, thus confirmin...
International audienceWe investigate the connection between properties of formal languages and prope...
DOI
Add to ORKG