Left-forbidding cooperating distributed grammar systems

4Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

A left-forbidding grammar, introduced in this paper, is a context-free grammar, where a set of nonterminal symbols is attached to each context-free production. Such a production can rewrite a nonterminal provided that no symbol from the attached set occurs to the left of the rewritten nonterminal in the current sentential form. The present paper discusses cooperating distributed grammar systems with left-forbidding grammars as components and gives some new characterizations of language families of the Chomsky hierarchy. In addition, it also proves that twelve nonterminals are enough for cooperating distributed grammar systems working in the terminal derivation mode with two left-forbidding components (including erasing productions) to characterize the family of recursively enumerable languages. © 2010 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Goldefus, F., Masopust, T., & Meduna, A. (2010). Left-forbidding cooperating distributed grammar systems. Theoretical Computer Science, 411(40–42), 3661–3667. https://doi.org/10.1016/j.tcs.2010.06.010

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free