Publication detail

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

MASOPUST, T. MEDUNA, A.

Original Title

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

English Title

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

Type

journal article in Web of Science

Language

en

Original Abstract

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.

English abstract

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.

Keywords

formal languages, context-free grammar, context-free rewriting system, derivation restriction, generative power.

RIV year

2009

Released

02.01.2009

Publisher

NEUVEDEN

Location

NEUVEDEN

Pages from

365

Pages to

378

Pages count

14

URL

BibTex


@article{BUT49309,
  author="Tomáš {Masopust} and Alexandr {Meduna}",
  title="On context-free rewriting with a simple restriction and its computational completeness",
  annote="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.",
  address="NEUVEDEN",
  chapter="49309",
  edition="NEUVEDEN",
  howpublished="print",
  institution="NEUVEDEN",
  journal="RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS",
  number="2",
  volume="43",
  year="2009",
  month="january",
  pages="365--378",
  publisher="NEUVEDEN",
  type="journal article in Web of Science"
}