Counting Simple Rules in Semi-conditional Grammars is not Simple
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 …
context-free core rule A→ w and (possibly) two strings w+, w-; the rule is applicable if w+(the …
Descriptional complexity of matrix simple semi-conditional grammars
Matrix grammars are one of the first approaches ever proposed in regulated rewriting,
prescribing that rules have to be applied in a certain order. Typical descriptional complexity …
prescribing that rules have to be applied in a certain order. Typical descriptional complexity …
On the computational completeness of matrix simple semi-conditional grammars
In matrix grammars, context-free rules have to be applied in a certain order. In simple semi-
conditional (SSC) grammars, the derivations are controlled either by a permitting string or by …
conditional (SSC) grammars, the derivations are controlled either by a permitting string or by …
On the computational completeness of several descriptional complexity restrictions of semi-conditional grammars
A semi-conditional grammar, introduced by Gheorghe Păun, is a form of regulated rewriting
system where each rule consists of a context-free core rule A→ w along with two strings w+ …
system where each rule consists of a context-free core rule A→ w along with two strings w+ …