AbstractScattered context generators derive their sentences followed by the corresponding parses. This paper discusses their two canonical versions, which make this derivation either in a leftmost or rightmost way. It demonstrates that for every recursively enumerable language, L, there exists a canonical scattered context generator whose language consists of L’s sentences followed by their parses. In fact, this result is established based on the generators containing no more than six nonterminals
AbstractThis paper discusses the descriptional complexity of scattered context grammars with respect...
This thesis introduces a new version of parallel communicating grammatical systems, where grammars w...
Automata, Logic and SemanticsIn 1973, V. Virkkunen proved that propagating scattered context grammar...
AbstractScattered context generators derive their sentences followed by the corresponding parses. Th...
This paper uses the propagating scattered context grammars to generate their language’s sentences to...
Propagating scattered context grammars are used to generate sentences of languages defined by scatte...
Propagating scattered context grammars are used to generate sentences of languages defined by scatte...
This work introduces and discusses generalized scattered context grammars that are based upon sequen...
AbstractThis paper discusses the descriptional complexity of scattered context grammars with respect...
AbstractThis paper introduces scattered context grammars without erasing productions, in which an ap...
The existing methods of the scattered context grammar parsing expand nonterminals deep in the pushdo...
AbstractWe improve the upper bounds of certain descriptional complexity measures of two types of rew...
AbstractScattered context grammars are defined and the closure properties of the family of languages...
AbstractScattered context grammars are a class of context-sensitive grammars. The rules of these gra...
AbstractThe left-hand side of a scattered context production, (A1,A2,…,An)→(x1,x2,…,xn), is terminat...
AbstractThis paper discusses the descriptional complexity of scattered context grammars with respect...
This thesis introduces a new version of parallel communicating grammatical systems, where grammars w...
Automata, Logic and SemanticsIn 1973, V. Virkkunen proved that propagating scattered context grammar...
AbstractScattered context generators derive their sentences followed by the corresponding parses. Th...
This paper uses the propagating scattered context grammars to generate their language’s sentences to...
Propagating scattered context grammars are used to generate sentences of languages defined by scatte...
Propagating scattered context grammars are used to generate sentences of languages defined by scatte...
This work introduces and discusses generalized scattered context grammars that are based upon sequen...
AbstractThis paper discusses the descriptional complexity of scattered context grammars with respect...
AbstractThis paper introduces scattered context grammars without erasing productions, in which an ap...
The existing methods of the scattered context grammar parsing expand nonterminals deep in the pushdo...
AbstractWe improve the upper bounds of certain descriptional complexity measures of two types of rew...
AbstractScattered context grammars are defined and the closure properties of the family of languages...
AbstractScattered context grammars are a class of context-sensitive grammars. The rules of these gra...
AbstractThe left-hand side of a scattered context production, (A1,A2,…,An)→(x1,x2,…,xn), is terminat...
AbstractThis paper discusses the descriptional complexity of scattered context grammars with respect...
This thesis introduces a new version of parallel communicating grammatical systems, where grammars w...
Automata, Logic and SemanticsIn 1973, V. Virkkunen proved that propagating scattered context grammar...