Další formáty:
BibTeX
LaTeX
RIS
@article{800092, author = {Masopust, Tomáš and Meduna, Alexander}, article_location = {Les Ulis (Francie)}, article_number = {2}, keywords = {formal languages, context-free grammar, context-free rewriting system, derivation restriction, generative power}, issn = {0988-3754}, journal = {RAIRO - Theoretical Informatics and Applications}, title = {On context-free rewriting with a simple restriction and its computational completeness}, url = {http://dx.doi.org/10.1051/ita/2009002}, volume = {43}, year = {2009} }
TY - JOUR ID - 800092 AU - Masopust, Tomáš - Meduna, Alexander PY - 2009 TI - On context-free rewriting with a simple restriction and its computational completeness JF - RAIRO - Theoretical Informatics and Applications VL - 43 IS - 2 SP - 365-378 EP - 365-378 PB - EDP Sciences SN - 09883754 KW - formal languages, context-free grammar, context-free rewriting system, derivation restriction, generative power UR - http://dx.doi.org/10.1051/ita/2009002 N2 - 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. ER -
MASOPUST, Tomáš a Alexander MEDUNA. On context-free rewriting with a simple restriction and its computational completeness. \textit{RAIRO - Theoretical Informatics and Applications}. Les Ulis (Francie): EDP Sciences, 2009, roč.~43, č.~2, s.~365-378. ISSN~0988-3754.
|