A hierarchy of context-free grammars and languages with respect to the index of context-free grammars is established and the undecidability of the basic problems is proven
AbstractWe define context-free grammars with Büchi acceptance condition generating languages of coun...
An extension for the concept of the finite index of context-free grammars is introduced and regular ...
AbstractIn this note we answer an open question in the theory of grammatical complexity: We show tha...
It is shown that there is a context-free language which has one grammar of finite index and another ...
We prove the following results concerning the index of grammars and languages. (1) Any context-free ...
It is proved that every grammar for a bounded, context-free language has finite index
An extension for the concept of the finite index of context-free grammars is introduced and regular ...
An example is given of a context-free grammar with infinite index. This solves a problem proposed by...
We prove the following results concerning the index of grammars and languages. (1) Any context-free ...
The relation between the family of context-free languages and the family of parallel context-free la...
In this paper we compare the effect of the finite index restriction on the generating power of the f...
AbstractA bracketed grammar is a context-free grammar in which indexed brackets are inserted around ...
This paper investigates generative grammars with only one type of symbol: no distinction is made bet...
AbstractIn this paper a notion of a grammar is defined which is an extension of a context-free gramm...
Given a reduced, cycle-free context-free grammar G = (Φ, Σ, P, y1), the following statements are equ...
AbstractWe define context-free grammars with Büchi acceptance condition generating languages of coun...
An extension for the concept of the finite index of context-free grammars is introduced and regular ...
AbstractIn this note we answer an open question in the theory of grammatical complexity: We show tha...
It is shown that there is a context-free language which has one grammar of finite index and another ...
We prove the following results concerning the index of grammars and languages. (1) Any context-free ...
It is proved that every grammar for a bounded, context-free language has finite index
An extension for the concept of the finite index of context-free grammars is introduced and regular ...
An example is given of a context-free grammar with infinite index. This solves a problem proposed by...
We prove the following results concerning the index of grammars and languages. (1) Any context-free ...
The relation between the family of context-free languages and the family of parallel context-free la...
In this paper we compare the effect of the finite index restriction on the generating power of the f...
AbstractA bracketed grammar is a context-free grammar in which indexed brackets are inserted around ...
This paper investigates generative grammars with only one type of symbol: no distinction is made bet...
AbstractIn this paper a notion of a grammar is defined which is an extension of a context-free gramm...
Given a reduced, cycle-free context-free grammar G = (Φ, Σ, P, y1), the following statements are equ...
AbstractWe define context-free grammars with Büchi acceptance condition generating languages of coun...
An extension for the concept of the finite index of context-free grammars is introduced and regular ...
AbstractIn this note we answer an open question in the theory of grammatical complexity: We show tha...
DOI
Add to ORKG