Publication detail

Weak Leftmost Derivations in Cooperative Distributed Grammar Systems

MEDUNA, A. GOLDEFUS, F.

Original Title

Weak Leftmost Derivations in Cooperative Distributed Grammar Systems

Type

article in a collection out of WoS and Scopus

Language

English

Original Abstract

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.

Keywords

leftmost derivation, cooperative distributed grammar systems, generative power, Chomsky Hierarchy

Authors

MEDUNA, A.; GOLDEFUS, F.

Released

3. 12. 2009

Publisher

Brno University of Technology

Location

Brno

ISBN

978-80-87342-04-6

Book

MEMICS 09

Pages from

144

Pages to

151

Pages count

8

BibTex

@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"
}