AbstractWe give an example of a language belonging to the class of indexed languages whose growth is intermediate. In particular, the growth function of this language is transcendental
We say that a language $L$ is \emph{constantly growing} if there is aconstant $c$ such that for ever...
A hierarchy of context-free grammars and languages with respect to the index of context-free grammar...
AbstractThe rational index ϱL of a non-empty language L is a non-decreasing function fromN∗ into N, ...
AbstractWe give an example of a language belonging to the class of indexed languages whose growth is...
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...
Context-free languages of sub-exponential growth were studied. The growth function was defined as th...
We extend the DSV method of computing the growth series of an unambiguous context-free lan...
AbstractLet F be a field of characteristic zero and let A be an F-algebra. The polynomial identities...
Abstract. A language L over a finite alphabet Σ is called growth-sensitive if forbidding any set of ...
AbstractWe prove that factorial languages defined over non-trivial finite alphabets under some natur...
We prove that factorial languages defined over non-trivial finite alphabets under some natural condi...
The aim of this paper is to survey the area formed by the intersection of two popular lines of resea...
AbstractThere are many ways to measure the complexity of languages. Rational index, introduced by Bo...
AbstractA language L over a finite alphabet Σ is called growth-sensitive if forbidding any set of su...
We say that a language $L$ is \emph{constantly growing} if there is aconstant $c$ such that for ever...
A hierarchy of context-free grammars and languages with respect to the index of context-free grammar...
AbstractThe rational index ϱL of a non-empty language L is a non-decreasing function fromN∗ into N, ...
AbstractWe give an example of a language belonging to the class of indexed languages whose growth is...
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...
Context-free languages of sub-exponential growth were studied. The growth function was defined as th...
We extend the DSV method of computing the growth series of an unambiguous context-free lan...
AbstractLet F be a field of characteristic zero and let A be an F-algebra. The polynomial identities...
Abstract. A language L over a finite alphabet Σ is called growth-sensitive if forbidding any set of ...
AbstractWe prove that factorial languages defined over non-trivial finite alphabets under some natur...
We prove that factorial languages defined over non-trivial finite alphabets under some natural condi...
The aim of this paper is to survey the area formed by the intersection of two popular lines of resea...
AbstractThere are many ways to measure the complexity of languages. Rational index, introduced by Bo...
AbstractA language L over a finite alphabet Σ is called growth-sensitive if forbidding any set of su...
We say that a language $L$ is \emph{constantly growing} if there is aconstant $c$ such that for ever...
A hierarchy of context-free grammars and languages with respect to the index of context-free grammar...
AbstractThe rational index ϱL of a non-empty language L is a non-decreasing function fromN∗ into N, ...
DOI
Add to ORKG