This computer science book represents scattered information by formal languages and gives
an in-depth discussion of scattered context grammars as formal means that process these …

The descriptional complexity of semi-conditional grammars (SCG) has been presented.
Semi-conditional grammars (SCG) are context-free grammars with a permitting and a …

In formal language theory, if a grammar consists of rules of the type (r, F r), where r is a
context-free rule and F r is an associated finite set of strings called the forbidding set, such …

This paper improves several well-known results concerning the descriptional complexity of
grammars regulated by context conditions. Specifically, it proves that every recursively …

Formal Models: Regulation and Reduction Page 1 i i “masopust-phdthesis-fitmono” — 2008/9/30
— 10:46 — page 1 — #1 i i i i i i Tomáš Masopust Formal Models: Regulation and Reduction …

A semi-conditional grammar is a form of regulated rewriting system. Each rule consists of a
context-free core rule A → w and two strings w_+, w_-; the rule is applicable if w_+(the …

Scattered context generators derive their sentences followed by the corresponding parses.
This paper discusses their two canonical versions, which make this derivation either in a …

This paper studies the nonterminal complexity of tree controlled grammars. It is proved that
the number of nonterminals in tree controlled grammars without erasing rules leads to an …

This paper presents some new results concerning the descriptional complexity of partially
parallel grammars. Specifically, it proves that every recursively enumerable language is …

A semi-conditional grammar is a form of regulated rewriting system. Each rule consists of a
context-free core rule A→ w and (possibly) two strings w+, w-; the rule is applicable if w+(the …