This paper presents a major and difficult decidability result in grammar form theory. It is proved that, given two arbitrary context-free grammar forms, it is decidable whether or not the family of one is contained in the other. This leads immediately to the decidability of the equality of two context-free grammar forms." This result is based on an earlier paper, "A prime decomposition theorem for grammatical families ", in which the same authors obtained a prime decomposition for formal language families, closely analogous in form to the decomposition of whole numbers into prime factors. Spanier's publications, as were his lectures, are characterized by unusual lucidity and precision and an even rarer quality of natural...
AbstractGiven a regular language L we construct a pure context-free grammar G such that L is pure co...
AbstractAn interpretation of a grammar form is called (k, i)-bounded iff all its nonterminals are su...
OS systems generalize context-free grammars without non-terminals. It is shown that it is decidable ...
AbstractIt is proved that form equivalence is decidable for context-free grammar forms with only one...
AbstractIt is proved that form equivalence is decidable for context-free grammar forms with only one...
AbstractA decision procedure involving the testing for containment is presented for determining whet...
Grammatical Framework (GF) [5] is a grammar for-malism originating from logical frameworks for de-pe...
A grammar G is left universal (universal) for a family of languages ℒ and finite alphabet Σ with res...
AbstractTwo basic operations on families of languages, in general, and grammatical families, in part...
AbstractThis paper studies the decidability status of various equivalence problems in form theory. M...
AbstractTwo basic operations on families of languages, in general, and grammatical families, in part...
Unification grammars are known to be Turing-equivalent; given a grammar G and a word w, it is undeci...
AbstractA decision procedure involving the testing for containment is presented for determining whet...
English grammar has been conventionally grouped into four major systems; traditional, structural, tr...
The universal generation problem for unification grammars is the problem of determining whether a gi...
AbstractGiven a regular language L we construct a pure context-free grammar G such that L is pure co...
AbstractAn interpretation of a grammar form is called (k, i)-bounded iff all its nonterminals are su...
OS systems generalize context-free grammars without non-terminals. It is shown that it is decidable ...
AbstractIt is proved that form equivalence is decidable for context-free grammar forms with only one...
AbstractIt is proved that form equivalence is decidable for context-free grammar forms with only one...
AbstractA decision procedure involving the testing for containment is presented for determining whet...
Grammatical Framework (GF) [5] is a grammar for-malism originating from logical frameworks for de-pe...
A grammar G is left universal (universal) for a family of languages ℒ and finite alphabet Σ with res...
AbstractTwo basic operations on families of languages, in general, and grammatical families, in part...
AbstractThis paper studies the decidability status of various equivalence problems in form theory. M...
AbstractTwo basic operations on families of languages, in general, and grammatical families, in part...
Unification grammars are known to be Turing-equivalent; given a grammar G and a word w, it is undeci...
AbstractA decision procedure involving the testing for containment is presented for determining whet...
English grammar has been conventionally grouped into four major systems; traditional, structural, tr...
The universal generation problem for unification grammars is the problem of determining whether a gi...
AbstractGiven a regular language L we construct a pure context-free grammar G such that L is pure co...
AbstractAn interpretation of a grammar form is called (k, i)-bounded iff all its nonterminals are su...
OS systems generalize context-free grammars without non-terminals. It is shown that it is decidable ...