Result Details
Left-Forbidding Cooperating Distributed Grammar Systems
In a left-forbidding grammar, a set of nonterminals is attached to every context-free production, and such a production can rewrite a nonterminal if no symbol from the attached set occurs to the left of the rewritten nonterminal in the sentential form. The present paper discusses left-forbidding cooperating distributed grammar systems that work in the terminating mode and have left-forbidding grammars as their components. It demonstrates that, with a single component, these systems generate the family of context-free languages, whereas, with two components, these systems generate the family of recursively enumerable languages.
left-forbidding grammar, cooperative distributed grammar system, left-forbidding cooperative distributed grammar system, state grammar, recursive enumerable languages
@inproceedings{BUT32783,
author="Filip {Goldefus}",
title="Left-Forbidding Cooperating Distributed Grammar Systems",
booktitle="Proceedings of the 14th Conference and Competition STUDENT EEICT 2008 Volume 4",
year="2008",
pages="403--407",
publisher="Faculty of Information Technology BUT",
address="Brno",
isbn="978-80-214-3617-6"
}