On context-free rewriting with a simple restriction and its computational completeness

Tomáš MasopustTomáš Masopust, Alexander MedunaAlexander Meduna

ISSN: 1290-385X
Download
DOI Link

Tomáš Masopust, Alexander Meduna
On context-free rewriting with a simple restriction and its computational completeness
RAIRO - Theoretical Informatics and Applications, 43(2):365-378, 2009

Details
Bibtex

KurzfassungAbstract
This paper discusses context-free rewriting systems in which there exist two disjoint finite sets of rules, and a symbol, referred to as a condition of applicability, is attached to each rule in either of these two sets. In one set, a rule with a symbol attached to it is applicable if the attached symbol occurs in the current rewritten string while in the other set, such a rule is applicable if the attached symbol does not occur there. The present paper demonstrates that these rewriting systems are computationally complete. From this main result, the paper derives several consequences and solves several open problems.
Forschungsgruppe:Research Group: Wissensbasierte SystemeKnowledge-Based Systems

@article{MM2009,
  author  = {Tom{\'{a}}{\v{s}} Masopust and Alexander Meduna},
  title   = {On context-free rewriting with a simple restriction and its
             computational completeness},
  journal = {RAIRO - Theoretical Informatics and Applications},
  volume  = {43},
  number  = {2},
  year    = {2009},
  pages   = {365-378},
  doi     = {10.1051/ita/2009002}
}