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.

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

@article{ITA_2009__43_2_365_0, author = {Masopust, Tom\'a\v{s} and Meduna, Alexander}, title = {On context-free rewriting with a simple restriction and its computational completeness}, journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications}, pages = {365--378}, publisher = {EDP-Sciences}, volume = {43}, number = {2}, year = {2009}, doi = {10.1051/ita/2009002}, zbl = {1171.68017}, mrnumber = {2512264}, language = {en}, url = {http://www.numdam.org/articles/10.1051/ita/2009002/} }

TY - JOUR AU - Masopust, Tomáš AU - Meduna, Alexander TI - On context-free rewriting with a simple restriction and its computational completeness JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 2009 SP - 365 EP - 378 VL - 43 IS - 2 PB - EDP-Sciences UR - http://www.numdam.org/articles/10.1051/ita/2009002/ DO - 10.1051/ita/2009002 LA - en ID - ITA_2009__43_2_365_0 ER -

%0 Journal Article %A Masopust, Tomáš %A Meduna, Alexander %T On context-free rewriting with a simple restriction and its computational completeness %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 2009 %P 365-378 %V 43 %N 2 %I EDP-Sciences %U http://www.numdam.org/articles/10.1051/ita/2009002/ %R 10.1051/ita/2009002 %G en %F ITA_2009__43_2_365_0

Masopust, Tomáš; Meduna, Alexander. On context-free rewriting with a simple restriction and its computational completeness. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 43 (2009) no. 2, pp. 365-378. doi : 10.1051/ita/2009002. http://www.numdam.org/articles/10.1051/ita/2009002/

[1] Regulated Rewriting in Formal Language Theory. Springer-Verlag, Berlin (1989). | MR | Zbl

and ,[2] Some restrictive devices for context-free grammars. Inform. Control 20 (1972) 69-92. | MR | Zbl

,[3] On semi-conditional grammars with productions having either forbidding or permitting conditions. Acta Cybernetica 11 (1994) 307-324. | MR | Zbl

and ,[4] Grammars with Context Conditions and Their Applications. John Wiley & Sons, New York (2005). | MR | Zbl

and ,[5] A variant of random context grammars: Semi-conditional grammars. Theoret. Comput. Sci. 41 (1985) 1-17. | MR | Zbl

,[6] Formal languages. Academic Press, New York (1973). | MR | Zbl

,[7] Random context grammars, in Proceedings of the Symposium on Formal Languages (1970).

,*Cited by Sources: *