Detail publikace

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

MASOPUST, T. MEDUNA, A.

Originální název

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

Typ

článek v časopise ve Web of Science, Jimp

Jazyk

angličtina

Originální abstrakt

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.

Klíčová slova

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

Autoři

MASOPUST, T.; MEDUNA, A.

Rok RIV

2009

Vydáno

2. 1. 2009

ISSN

0988-3754

Periodikum

RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS

Ročník

43

Číslo

2

Stát

Francouzská republika

Strany od

365

Strany do

378

Strany počet

14

URL

http://dx.doi.org/10.1051/ita/2009002

BibTex

@article{BUT49309,
  author="Tomáš {Masopust} and Alexandr {Meduna}",
  title="On context-free rewriting with a simple restriction and its computational completeness",
  journal="RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS",
  year="2009",
  volume="43",
  number="2",
  pages="365--378",
  issn="0988-3754",
  url="http://dx.doi.org/10.1051/ita/2009002"
}