Publication Details

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

MASOPUST, T.; MEDUNA, A. On context-free rewriting with a simple restriction and its computational completeness. RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2009, vol. 43, no. 2, p. 365-378. ISSN: 0988-3754.
Czech title
O bezkontextovém přepisování s jednoduchým omezením a jeho výpočetní úplnost
Type
journal article
Language
English
Authors
Masopust Tomáš, doc. RNDr., Ph.D. (CM-SFE)
Meduna Alexandr, prof. RNDr., CSc. (DIFS)
URL
Keywords

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

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.

Published
2009
Pages
365–378
Journal
RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, vol. 43, no. 2, ISSN 0988-3754
UT WoS
000264879300012
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"
}
Back to top