AbstractIt is proved that form equivalence is decidable for context-free grammar forms with only one nonterminal and one terminal symbol. However it also proved that there are “many” grammatical families generated by such forms: with some trivial exceptions, the families are dense in the sense that between any two families one can “squeeze” in a third one. The results obtained are applied also to L forms
AbstractWe define context-free grammars with Müller acceptance condition that generate languages of ...
AbstractThe equivalence problem for context-free grammars is “given two arbitrary grammars, do they ...
The equivalence problem for nondeterministic e-free generalized machines is known to be undecidable....
AbstractIt is proved that form equivalence is decidable for context-free grammar forms with only one...
AbstractThis paper studies the decidability status of various equivalence problems in form theory. M...
This paper presents a major and difficult decidability result in grammar form theory. It is proved t...
AbstractAn interpretation of a grammar form is called (k, i)-bounded iff all its nonterminals are su...
AbstractPure grammars are grammars without non-terminals. In this paper we show as one main result t...
AbstractThis paper begins a systematic investigation of context-free grammar forms using the mechani...
AbstractIn [5] the notion of an L form F defining a family Ld(F) of languages by means of X-interpre...
AbstractA context-free grammar is said to be NTS if the set of sentential forms it generates is unch...
AbstractA decision procedure involving the testing for containment is presented for determining whet...
This paper investigates generative grammars with only one type of symbol: no distinction is made bet...
AbstractA decision procedure involving the testing for containment is presented for determining whet...
AbstractPure grammars are grammars without non-terminals. In this paper we show as one main result t...
AbstractWe define context-free grammars with Müller acceptance condition that generate languages of ...
AbstractThe equivalence problem for context-free grammars is “given two arbitrary grammars, do they ...
The equivalence problem for nondeterministic e-free generalized machines is known to be undecidable....
AbstractIt is proved that form equivalence is decidable for context-free grammar forms with only one...
AbstractThis paper studies the decidability status of various equivalence problems in form theory. M...
This paper presents a major and difficult decidability result in grammar form theory. It is proved t...
AbstractAn interpretation of a grammar form is called (k, i)-bounded iff all its nonterminals are su...
AbstractPure grammars are grammars without non-terminals. In this paper we show as one main result t...
AbstractThis paper begins a systematic investigation of context-free grammar forms using the mechani...
AbstractIn [5] the notion of an L form F defining a family Ld(F) of languages by means of X-interpre...
AbstractA context-free grammar is said to be NTS if the set of sentential forms it generates is unch...
AbstractA decision procedure involving the testing for containment is presented for determining whet...
This paper investigates generative grammars with only one type of symbol: no distinction is made bet...
AbstractA decision procedure involving the testing for containment is presented for determining whet...
AbstractPure grammars are grammars without non-terminals. In this paper we show as one main result t...
AbstractWe define context-free grammars with Müller acceptance condition that generate languages of ...
AbstractThe equivalence problem for context-free grammars is “given two arbitrary grammars, do they ...
The equivalence problem for nondeterministic e-free generalized machines is known to be undecidable....