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 t-mode and have leftforbidding grammars as their components. It demonstrates that with two components, these systems generate the family of recursively enumerable languages.

• Type: Journal
• Year: 2010
• Where: TCS
• Authors: Filip Goldefus, Tomás Masopust, Alexander Meduna
• Keywords: Context-free Production, Grammars, Sentential Form, TCS 2010, Theoretical Computer Science