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

  title={On context-free rewriting with a simple restriction and its computational completeness},
  author={Tomas Masopust and Alexander Meduna},
  journal={RAIRO Theor. Informatics Appl.},
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… 

Figures from this paper

Comparison of Two Context-Free Rewriting Systems with Simple Context-Checking Mechanisms
It is demonstrated that the family of languages generated by semi-conditional grammars of degree (1,1) coincides with the familyof random context languages, and it is shown that the normal form proved by Mayer for random context Grammars with erasing productions holds forrandom context grammar without erasing production, too.
Simple Restriction in Context-Free Rewriting
  • Tom
  • Computer Science
  • 2009
This paper presents such a simple restriction introducing so-called restricted contextfree rewriting systems, with context conditions assigned to nonterminals, not to productions, and their type is the simplest possible|a nonterminal.
Simple restriction in context-free rewriting
On Restricted Context-Free Grammars
A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions
This paper answers three open questions concerning the generative power of some simple variants of context-free grammars regulated by context conditions and presents some normal form results, an overview of known results, and unsolved problems.
Regulated Grammars and Automata
This is the first book to offer key theoretical topics and terminology concerning regulated grammars and automata. They are the most important language-defining devices that work under controls
Chapter 21 Concluding Remarks
This three-section chapter makes several final remarks concerning the material covered in this book. First, Sect.21.1 describes new investigation trends closely related to regulated grammars and
Modern Language Models and Computation
On restricted context-free grammars
  • J. Comput. Syst. Sci.
  • 2012


Regulated Rewriting in Formal Language Theory
This book presents 25 different regulating mechanisms by definitions, examples and basic facts, especially concerning hierarchies, as well as selective substitution grammars as one common generalization.
Some Restrictive Devices for Context-Free Grammars
  • O. Mayer
  • Computer Science
    Inf. Control.
  • 1972
On Semi-Conditional Grammars with Productions Having either Forbidding or Permitting Conditions
This paper simplifies semi-conditional grammars so their productions have no more than one associated word-either a permitting condition or a forbidding condition. It is demonstrated that this
Formal languages
  • A. Salomaa
  • Computer Science
    Computer science classics
  • 1987
The dates will be set by the publisher)
  • The dates will be set by the publisher)
Communicated by (The editor will be set by the publisher
  • Communicated by (The editor will be set by the publisher
Random context grammars
  • Proceedings of the Symposium on Formal Languages
  • 1970