A General Framework for Regulated Rewriting Based on the Applicability of Rules

Regulated Tree Automata

“…By the definitions themselves, we can conclude (also confer [11], but mind the partially different definitions):…”

Contextual Array Grammars with Matrix and Regular Control

“…In this paper we consider matrix contextual array grammars and contextual array grammars with regular control and examine their generative power. In the 1-dimensional case, we obtain special results: the family of 1-dimensional array languages generated by contextual array grammars with regular control languages coincides with the family of regular 1-dimensional array languages over unary alphabets and with array images of the linear languages over alphabets with more than one letter; already for binary alphabets, regular control is strictly more powerful than matrix control, a phenomenon rarely observed in regulated rewriting (confer [10]).…”

“…ContA k is obvious from general results for grammars working on various kinds of objects and with specific regulating mechanisms, see [10].…”

Priorities, Promoters and Inhibitors in Deterministic Non-cooperative P Systems

“…It is worth to note, see also [4], that if no other control is used, the priorities can be mapped to sets of atomic inhibitors. Indeed, a rule is inhibited precisely by the left side of each higher priority rule.…”