Rewriting Systems with Limited Distance Forbidding Context

Research output: Contribution to journalArticlepeer-review

Abstract

A random context production has a permitting and forbidding context. A symbol can be rewritten using such a production if all the permitting context symbols and no forbidding context symbol appear in the sentential string. In this paper we limit the effect of forbidding context symbols to be within a certain distance from the symbol to be rewritten. Outside this distance the forbidding context symbols do not influence the rewriting of a symbol. This restriction strictly increases the generating power of the rewriting system. A further result of this paper is a “negative parallel” version of Penttonen's normal form.

Original languageEnglish
Pages (from-to)227-239
Number of pages13
JournalInternational Journal of Computer Mathematics
Volume11
Issue number3-4
DOIs
Publication statusPublished - 1 Jan 1982

Keywords

  • L-systems
  • Parallel rewriting systems
  • forbidding context

ASJC Scopus subject areas

  • Computer Science Applications
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Rewriting Systems with Limited Distance Forbidding Context'. Together they form a unique fingerprint.

Cite this