Publication Details
Left-Forbidding Cooperating Distributed Grammar Systems
left-forbidding grammar, cooperative distributed grammar system, left-forbidding cooperative distributed grammar system, state grammar, recursive enumerable languages
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.
@INPROCEEDINGS{FITPUB8651, author = "Filip Goldefus", title = "Left-Forbidding Cooperating Distributed Grammar Systems", pages = "403--407", booktitle = "Proceedings of the 14th Conference and Competition STUDENT EEICT 2008 Volume 4", year = 2008, location = "Brno, CZ", publisher = "Faculty of Information Technology BUT", ISBN = "978-80-214-3617-6", language = "english", url = "https://www.fit.vut.cz/research/publication/8651" }