Hostname: page-component-cb9f654ff-pvkqz Total loading time: 0 Render date: 2025-08-30T12:08:06.415Z Has data issue: false hasContentIssue false
  • English
  • Français

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

Published online by Cambridge University Press:  06 March 2009

Tomáš Masopust  and
Alexander Meduna
Tomáš Masopust
Affiliation:
Faculty of Information Technology, Brno University of Technology, Božetěchova 2, Brno 61266, Czech Republic. masopust@fit.vutbr.cz; meduna@fit.vutbr.cz
Alexander Meduna
Affiliation:
Faculty of Information Technology, Brno University of Technology, Božetěchova 2, Brno 61266, Czech Republic. masopust@fit.vutbr.cz; meduna@fit.vutbr.cz
Get access

Abstract

This paper discusses context-free rewriting systems inwhich 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.

Keywords

Formal languagescontext-free grammarcontext-free rewriting systemderivation restrictiongenerative power.

Information

Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 43 , Issue 2 , April 2009 , pp. 365 - 378
Copyright
© EDP Sciences, 2008

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

J. Dassow and G. Păun, Regulated Rewriting in Formal Language Theory. Springer-Verlag, Berlin (1989).
Mayer, O., Some restrictive devices for context-free grammars. Inform. Control 20 (1972) 69–92. CrossRef
Meduna, A. and Gopalaratnam, A., On semi-conditional grammars with productions having either forbidding or permitting conditions. Acta Cybernetica 11 (1994) 307–324.
A. Meduna and M. Švec, Grammars with Context Conditions and Their Applications. John Wiley & Sons, New York (2005).
Păun, G., A variant of random context grammars: Semi-conditional grammars. Theoret. Comput. Sci. 41 (1985) 1–17. CrossRef
A. Salomaa, Formal languages. Academic Press, New York (1973).
A.P.J. van der Walt, Random context grammars, in Proceedings of the Symposium on Formal Languages (1970).