AbstractThis paper studies the decidability status of various equivalence problems in form theory. Most of our discussions concern the notion of a language form. We compare the form equivalence problem between language forms with the ordinary equivalence problem between languages. However, the main results deal with L forms and grammar forms under strict interpretations. We prove that the form equivalence problem is undecidable for (a) context-free grammar forms, and (b) E0L forms. The proofs of these results are based on our investigations concerning language forms
For a given context-sensitive grammar G we construct ET0L grammars G_1 and G_2 that are structurally...
The equivalence problem for nondeterministic e-free generalized machines is known to be undecidable....
AbstractFor a given context-sensitive grammar G we construct ET0L grammars G1 and G2 that are struct...
AbstractIt is proved that form equivalence is decidable for context-free grammar forms with only one...
AbstractPure grammars are grammars without non-terminals. In this paper we show as one main result t...
The equivalence problem for nondeterministic e-free generalized machines is known to be undecidable....
AbstractIn [5] the notion of an L form F defining a family Ld(F) of languages by means of X-interpre...
AbstractWhen working with E0L forms, equality of languages and of language families has traditionall...
AbstractIt is proved that form equivalence is decidable for context-free grammar forms with only one...
AbstractPure grammars are grammars without non-terminals. In this paper we show as one main result t...
AbstractIt is undecidable whether or not a given context-free language and a propagating DT0L langua...
The notions of an EIL form and its interpretations are introduced. The resulting families of L syste...
AbstractThe equivalence problem for context-free grammars is “given two arbitrary grammars, do they ...
AbstractA context-free grammar is said to be NTS if the set of sentential forms it generates is unch...
AbstractThis paper begins a systematic investigation of context-free grammar forms using the mechani...
For a given context-sensitive grammar G we construct ET0L grammars G_1 and G_2 that are structurally...
The equivalence problem for nondeterministic e-free generalized machines is known to be undecidable....
AbstractFor a given context-sensitive grammar G we construct ET0L grammars G1 and G2 that are struct...
AbstractIt is proved that form equivalence is decidable for context-free grammar forms with only one...
AbstractPure grammars are grammars without non-terminals. In this paper we show as one main result t...
The equivalence problem for nondeterministic e-free generalized machines is known to be undecidable....
AbstractIn [5] the notion of an L form F defining a family Ld(F) of languages by means of X-interpre...
AbstractWhen working with E0L forms, equality of languages and of language families has traditionall...
AbstractIt is proved that form equivalence is decidable for context-free grammar forms with only one...
AbstractPure grammars are grammars without non-terminals. In this paper we show as one main result t...
AbstractIt is undecidable whether or not a given context-free language and a propagating DT0L langua...
The notions of an EIL form and its interpretations are introduced. The resulting families of L syste...
AbstractThe equivalence problem for context-free grammars is “given two arbitrary grammars, do they ...
AbstractA context-free grammar is said to be NTS if the set of sentential forms it generates is unch...
AbstractThis paper begins a systematic investigation of context-free grammar forms using the mechani...
For a given context-sensitive grammar G we construct ET0L grammars G_1 and G_2 that are structurally...
The equivalence problem for nondeterministic e-free generalized machines is known to be undecidable....
AbstractFor a given context-sensitive grammar G we construct ET0L grammars G1 and G2 that are struct...