Result Details
Weak Leftmost Derivations in Cooperative Distributed Grammar Systems
Goldefus Filip, Mgr., DIFS (FIT)
This paper introduces and discusses a weak leftmost restriction placedupon derivations in cooperative distributed grammar systems. Duringevery derivation step restricted in this way, a system rewrites theleftmost nonterminal coinciding with the left-hand side of a productionthat belong to a prescribed set of productions in a grammaticalcomponent of the system. The present paper proves that cooperativedistributed grammar systems restricted in this way characterize thefamily of recursively enumerable languages.
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.
@inproceedings{BUT91231,
author="Alexandr {Meduna} and Filip {Goldefus}",
title="Weak Leftmost Derivations in Cooperative Distributed Grammar Systems",
booktitle="MEMICS 09",
year="2009",
pages="144--151",
publisher="Brno University of Technology",
address="Brno",
isbn="978-80-87342-04-6"
}