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

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F09%3APU82560" target="_blank" >RIV/00216305:26230/09:PU82560 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

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

Original language description

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 symbolattached 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.<br>

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BD - Information theory

OECD FORD branch

—

Project

<a href="/en/project/GA201%2F07%2F0005" target="_blank" >GA201/07/0005: Multi-information technologies: Theory, models, and methods</a><br>

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2009

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS

ISSN

0988-3754

e-ISSN

—

Volume of the periodical

43

Issue of the periodical within the volume

2

Country of publishing house

FR - FRANCE

Number of pages

14

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—