We continue the study of finite grammatical families by characterizing when a family has a predecessor. This characterization implies that (i) the existence of predecessors for finite families is decidable and (ii) the collection of context-free grammatical families, each family of which contains all regular languages, is not maximal dense
AbstractThe ancestor width is a new measure for the structure of derivations of arbitrary grammars. ...
In this paper we compare the effect of the finite index restriction on the generating power of the f...
AbstractIn this paper the investigation of the theory of grammatical complexity as started by Bucher...
We continue the study of finite grammatical families by characterizing when a family has a predecess...
AbstractA decision procedure involving the testing for containment is presented for determining whet...
AbstractIt is proved that form equivalence is decidable for context-free grammar forms with only one...
Let ℒCI be the family of context-free languages. Two characterization theorems are given for (contex...
In this report, we emphasize the differences of grammar families and their properties versus l...
AbstractThis paper studies context-free sets of finite and infinite words. In particular, it gives a...
It has been pointed out that context-free grammars of a certain class have the property that a one-o...
It is proved that every grammar for a bounded, context-free language has finite index
We explore an analogy between the family B 1 of finite/cofinite languages and the family Y1 of langu...
Any one counter language that is not nonterminal bounded must contain an infinite regular set; every...
This paper is a first attempt to systematically study collections of language families which are den...
A grammar can be regarded as a device that enumerates the sentences of a language. We study a sequen...
AbstractThe ancestor width is a new measure for the structure of derivations of arbitrary grammars. ...
In this paper we compare the effect of the finite index restriction on the generating power of the f...
AbstractIn this paper the investigation of the theory of grammatical complexity as started by Bucher...
We continue the study of finite grammatical families by characterizing when a family has a predecess...
AbstractA decision procedure involving the testing for containment is presented for determining whet...
AbstractIt is proved that form equivalence is decidable for context-free grammar forms with only one...
Let ℒCI be the family of context-free languages. Two characterization theorems are given for (contex...
In this report, we emphasize the differences of grammar families and their properties versus l...
AbstractThis paper studies context-free sets of finite and infinite words. In particular, it gives a...
It has been pointed out that context-free grammars of a certain class have the property that a one-o...
It is proved that every grammar for a bounded, context-free language has finite index
We explore an analogy between the family B 1 of finite/cofinite languages and the family Y1 of langu...
Any one counter language that is not nonterminal bounded must contain an infinite regular set; every...
This paper is a first attempt to systematically study collections of language families which are den...
A grammar can be regarded as a device that enumerates the sentences of a language. We study a sequen...
AbstractThe ancestor width is a new measure for the structure of derivations of arbitrary grammars. ...
In this paper we compare the effect of the finite index restriction on the generating power of the f...
AbstractIn this paper the investigation of the theory of grammatical complexity as started by Bucher...
DOI
Add to ORKG