DOIAbstract
We extend the DSV method of computing the growth series of an unambiguous context-free language to the larger class of indexed languages. We illustrate the technique with numerous examples
We extend the DSV method of computing the growth series of an unambiguous context-free language to the larger class of indexed languages. We illustrate the technique with numerous examples
Well investigated are growing context-sensitive languages (GCSL), i. e. languages defined by grammar...
The structure generating function of a language enumerates the number of distinct words contained in...
AbstractIn this paper a notion of a grammar is defined which is an extension of a context-free gramm...
We extend the DSV method of computing the growth series of an unambiguous context-free lan...
AbstractIn this paper we show that the growth of a context-free language is either polynomial or exp...
AbstractWe give an example of a language belonging to the class of indexed languages whose growth is...
Context-free languages of sub-exponential growth were studied. The growth function was defined as th...
The aim of this paper is to survey the area formed by the intersection of two popular lines of resea...
Abstract. A language L over a finite alphabet Σ is called growth-sensitive if forbidding any set of ...
AbstractIt is well known that the growth of a context-free language is either polynomial or exponent...
AbstractA language L over a finite alphabet Σ is called growth-sensitive if forbidding any set of su...
Indexed languages are languages recognized by pushdown automata of level 2 and by indexed grammars. ...
AbstractThe parallel complexity of computing context-free grammar generating series is investigated....
AbstractAn index for an r.e. class of languages (by definition) is a procedure which generates a seq...
Indexed languages are interesting in computational linguistics because they are the least class of l...
Well investigated are growing context-sensitive languages (GCSL), i. e. languages defined by grammar...
The structure generating function of a language enumerates the number of distinct words contained in...
AbstractIn this paper a notion of a grammar is defined which is an extension of a context-free gramm...
We extend the DSV method of computing the growth series of an unambiguous context-free lan...
AbstractIn this paper we show that the growth of a context-free language is either polynomial or exp...
AbstractWe give an example of a language belonging to the class of indexed languages whose growth is...
Context-free languages of sub-exponential growth were studied. The growth function was defined as th...
The aim of this paper is to survey the area formed by the intersection of two popular lines of resea...
Abstract. A language L over a finite alphabet Σ is called growth-sensitive if forbidding any set of ...
AbstractIt is well known that the growth of a context-free language is either polynomial or exponent...
AbstractA language L over a finite alphabet Σ is called growth-sensitive if forbidding any set of su...
Indexed languages are languages recognized by pushdown automata of level 2 and by indexed grammars. ...
AbstractThe parallel complexity of computing context-free grammar generating series is investigated....
AbstractAn index for an r.e. class of languages (by definition) is a procedure which generates a seq...
Indexed languages are interesting in computational linguistics because they are the least class of l...
Well investigated are growing context-sensitive languages (GCSL), i. e. languages defined by grammar...
The structure generating function of a language enumerates the number of distinct words contained in...
AbstractIn this paper a notion of a grammar is defined which is an extension of a context-free gramm...
Add to ORKG