summary:Suppose that some polynomial $f$ with rational coefficients takes only natural values at natural numbers, i. e., $L=\{f(n)\mid n\in {\mathbb N}\}\subseteq {\mathbb N}$. We show that the base-$q$ representation of $L$ is a context-free language if and only if $f$ is linear, answering a question of Shallit. The proof is based on a new criterion for context-freeness, which is a combination of the Interchange lemma and a generalization of the Pumping lemma
International audienceThis paper formalises the idea of substitutability introduced by Zellig Harris...
AbstractPumping lemmas are stated and proved for the classes of regular and context-free sets of ter...
In this paper context-free languages are investigated according to their ordering properties. For th...
summary:Suppose that some polynomial $f$ with rational coefficients takes only natural values at nat...
Pumping lemmas play important role in formal language theory. One can prove that a language does not...
AbstractIt is well known that the growth of a context-free language is either polynomial or exponent...
Given a reduced, cycle-free context-free grammar G = (Φ, Σ, P, y1), the following statements are equ...
Context-freedom of a language implies certain intercalation properties known as pumping or iteration...
AbstractIn this paper we show that the growth of a context-free language is either polynomial or exp...
AbstractWe define context-free grammars with Müller acceptance condition that generate languages of ...
The classes of languages Ti are defined, i being a natural number, for which it is proved that Ti is...
Context-free languages are highly important in computer language processing technology as well as in...
Any one counter language that is not nonterminal bounded must contain an infinite regular set; every...
A sufficient condition is given in order for the set of those words, which are obtained by permuting...
AbstractLet Σ = {a1, a2, …, an} be an alphabet and let L ⊂ Σ∗ be the commutative image of FP∗ where ...
International audienceThis paper formalises the idea of substitutability introduced by Zellig Harris...
AbstractPumping lemmas are stated and proved for the classes of regular and context-free sets of ter...
In this paper context-free languages are investigated according to their ordering properties. For th...
summary:Suppose that some polynomial $f$ with rational coefficients takes only natural values at nat...
Pumping lemmas play important role in formal language theory. One can prove that a language does not...
AbstractIt is well known that the growth of a context-free language is either polynomial or exponent...
Given a reduced, cycle-free context-free grammar G = (Φ, Σ, P, y1), the following statements are equ...
Context-freedom of a language implies certain intercalation properties known as pumping or iteration...
AbstractIn this paper we show that the growth of a context-free language is either polynomial or exp...
AbstractWe define context-free grammars with Müller acceptance condition that generate languages of ...
The classes of languages Ti are defined, i being a natural number, for which it is proved that Ti is...
Context-free languages are highly important in computer language processing technology as well as in...
Any one counter language that is not nonterminal bounded must contain an infinite regular set; every...
A sufficient condition is given in order for the set of those words, which are obtained by permuting...
AbstractLet Σ = {a1, a2, …, an} be an alphabet and let L ⊂ Σ∗ be the commutative image of FP∗ where ...
International audienceThis paper formalises the idea of substitutability introduced by Zellig Harris...
AbstractPumping lemmas are stated and proved for the classes of regular and context-free sets of ter...
In this paper context-free languages are investigated according to their ordering properties. For th...