AbstractThe left-hand side of a scattered context production, (A1,A2,…,An)→(x1,x2,…,xn), is terminating if A1A2…An derives a terminal word. This paper discusses scattered context grammars whose sentential forms contain sequences of nonterminals formed by shuffling the terminating left-hand sides of productions. It proves that these grammars do not generate some context-sensitive languages, so they are less powerful than the scattered context grammars whose sentential forms are unrestricted. In its conclusion, this paper demonstrates the impact of this result and discusses open problems
This paper discusses scattered context grammars (SCG) and considers the application of scattered con...
AbstractContext-free grammars are widely used for the simple form of their rules. A derivation step ...
Propagating scattered context grammars are used to generate sentences of languages defined by scatte...
AbstractThe left-hand side of a scattered context production, (A1,A2,…,An)→(x1,x2,…,xn), is terminat...
This work introduces and discusses generalized scattered context grammars that are based upon sequen...
AbstractThis paper introduces scattered context grammars without erasing productions, in which an ap...
AbstractScattered context grammars are defined and the closure properties of the family of languages...
This paper presents a transformation that converts any phrase-structure grammar, H, in Penttonen nor...
AbstractScattered context generators derive their sentences followed by the corresponding parses. Th...
AbstractThis paper discusses the descriptional complexity of scattered context grammars with respect...
Automata, Logic and SemanticsIn 1973, V. Virkkunen proved that propagating scattered context grammar...
AbstractScattered context grammars are a class of context-sensitive grammars. The rules of these gra...
In 1973, Virkkunen proved that propagating scattered context grammars which use leftmost derivatio...
AbstractWe improve the upper bounds of certain descriptional complexity measures of two types of rew...
If G is a grammar such that in each non-context-free rule of G, the right side contains a string of ...
This paper discusses scattered context grammars (SCG) and considers the application of scattered con...
AbstractContext-free grammars are widely used for the simple form of their rules. A derivation step ...
Propagating scattered context grammars are used to generate sentences of languages defined by scatte...
AbstractThe left-hand side of a scattered context production, (A1,A2,…,An)→(x1,x2,…,xn), is terminat...
This work introduces and discusses generalized scattered context grammars that are based upon sequen...
AbstractThis paper introduces scattered context grammars without erasing productions, in which an ap...
AbstractScattered context grammars are defined and the closure properties of the family of languages...
This paper presents a transformation that converts any phrase-structure grammar, H, in Penttonen nor...
AbstractScattered context generators derive their sentences followed by the corresponding parses. Th...
AbstractThis paper discusses the descriptional complexity of scattered context grammars with respect...
Automata, Logic and SemanticsIn 1973, V. Virkkunen proved that propagating scattered context grammar...
AbstractScattered context grammars are a class of context-sensitive grammars. The rules of these gra...
In 1973, Virkkunen proved that propagating scattered context grammars which use leftmost derivatio...
AbstractWe improve the upper bounds of certain descriptional complexity measures of two types of rew...
If G is a grammar such that in each non-context-free rule of G, the right side contains a string of ...
This paper discusses scattered context grammars (SCG) and considers the application of scattered con...
AbstractContext-free grammars are widely used for the simple form of their rules. A derivation step ...
Propagating scattered context grammars are used to generate sentences of languages defined by scatte...