Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikace
GOLDEFUS, F.
Originální název
Left-Forbidding Cooperating Distributed Grammar Systems
Typ
článek ve sborníku mimo WoS a Scopus
Jazyk
angličtina
Originální abstrakt
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.
Klíčová slova
left-forbidding grammar, cooperative distributed grammar system, left-forbidding cooperative distributed grammar system, state grammar, recursive enumerable languages
Autoři
Rok RIV
2008
Vydáno
24. 4. 2008
Nakladatel
Faculty of Information Technology BUT
Místo
Brno
ISBN
978-80-214-3617-6
Kniha
Proceedings of the 14th Conference and Competition STUDENT EEICT 2008 Volume 4
Strany od
403
Strany do
407
Strany počet
5
BibTex
@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" }