Publication Details
Weak Leftmost Derivations in Cooperative Distributed Grammar Systems
leftmost derivation, cooperative distributed grammar systems, generative power, Chomsky Hierarchy
This paper introduces and discusses a weak leftmost restriction placed upon derivations in cooperative distributed grammar systems. During every derivation step restricted in this way, a system rewrites the leftmost nonterminal coinciding with the left-hand side of a production that belong to a prescribed set of productions in a grammatical component of the system. The present paper proves that cooperative distributed grammar systems restricted in this way characterize the family of recursively enumerable languages.
This paper introduces and discusses a weak leftmost restriction placed upon derivations in cooperative distributed grammar systems. During every derivation step restricted in this way, a system rewrites the leftmost nonterminal coinciding with the left-hand side of a production that belong to a prescribed set of productions in a grammatical component of the system. The present paper proves that cooperative distributed grammar systems restricted in this way characterize the family of recursively enumerable languages.
@INPROCEEDINGS{FITPUB9118, author = "Alexander Meduna and Filip Goldefus", title = "Weak Leftmost Derivations in Cooperative Distributed Grammar Systems", pages = "144--151", booktitle = "MEMICS 09", year = 2009, location = "Brno, CZ", publisher = "Brno University of Technology", ISBN = "978-80-87342-04-6", language = "english", url = "https://www.fit.vut.cz/research/publication/9118" }