Publication date
March 2001
DOI Publisher
Elsevier Science B.V. ISSN
0304-3975Abstract
AbstractIn this paper we show that the growth of a context-free language is either polynomial or exponential
AbstractIn this paper we show that the growth of a context-free language is either polynomial or exponential
AbstractWe establish that several classical context-free languages are inherently ambiguous by provi...
The aim of this paper is to survey the area formed by the intersection of two popular lines of resea...
AbstractIt is known that the number of overlap-free binary words of length n grows polynomially, whi...
AbstractIt is well known that the growth of a context-free language is either polynomial or exponent...
AbstractIn this paper we show that the growth of a context-free language is either polynomial or exp...
AbstractA language L over a finite alphabet Σ is called growth-sensitive if forbidding any set of su...
Context-free languages of sub-exponential growth were studied. The growth function was defined as th...
AbstractWe give an example of a language belonging to the class of indexed languages whose growth is...
Abstract. A language L over a finite alphabet Σ is called growth-sensitive if forbidding any set of ...
The problem of the commutative equivalence of context-free and regular languages is studied. Conditi...
The POL be the class of polynomials having nonnegative integer coefficients and EXP the class of exp...
The problem of the commutative equivalence of context-free and regular languages is studied. In part...
We say that a language $L$ is \emph{constantly growing} if there is a constant $c$ such that for eve...
A context-free grammar is a set of mathematical rules that classifies strings (sequences of symbols)...
AbstractLet S be the set of all palindromes over Σ∗. It is well known, that the language S2 is an ul...
AbstractWe establish that several classical context-free languages are inherently ambiguous by provi...
The aim of this paper is to survey the area formed by the intersection of two popular lines of resea...
AbstractIt is known that the number of overlap-free binary words of length n grows polynomially, whi...
AbstractIt is well known that the growth of a context-free language is either polynomial or exponent...
AbstractIn this paper we show that the growth of a context-free language is either polynomial or exp...
AbstractA language L over a finite alphabet Σ is called growth-sensitive if forbidding any set of su...
Context-free languages of sub-exponential growth were studied. The growth function was defined as th...
AbstractWe give an example of a language belonging to the class of indexed languages whose growth is...
Abstract. A language L over a finite alphabet Σ is called growth-sensitive if forbidding any set of ...
The problem of the commutative equivalence of context-free and regular languages is studied. Conditi...
The POL be the class of polynomials having nonnegative integer coefficients and EXP the class of exp...
The problem of the commutative equivalence of context-free and regular languages is studied. In part...
We say that a language $L$ is \emph{constantly growing} if there is a constant $c$ such that for eve...
A context-free grammar is a set of mathematical rules that classifies strings (sequences of symbols)...
AbstractLet S be the set of all palindromes over Σ∗. It is well known, that the language S2 is an ul...
AbstractWe establish that several classical context-free languages are inherently ambiguous by provi...
The aim of this paper is to survey the area formed by the intersection of two popular lines of resea...
AbstractIt is known that the number of overlap-free binary words of length n grows polynomially, whi...
Add to ORKG