Detail výsledku

Weak Leftmost Derivations in Cooperative Distributed Grammar Systems

MEDUNA, A.; GOLDEFUS, F. Weak Leftmost Derivations in Cooperative Distributed Grammar Systems. MEMICS 09. Brno: Brno University of Technology, 2009. p. 144-151. ISBN: 978-80-87342-04-6.
Typ
článek ve sborníku konference
Jazyk
anglicky
Autoři
Meduna Alexandr, prof. RNDr., CSc., UIFS (FIT)
Goldefus Filip, Mgr., UIFS (FIT)
Abstrakt

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.

Klíčová slova

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

Rok
2009
Strany
144–151
Sborník
MEMICS 09
Konference
MEMICS'09 -- 5th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science
ISBN
978-80-87342-04-6
Vydavatel
Brno University of Technology
Místo
Brno
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"
}
Projekty
Multiinformační technologie, GAČR, Standardní projekty, GA201/07/0005, zahájení: 2007-01-01, ukončení: 2009-12-31, ukončen
Pracoviště
Ústav informačních systémů (UIFS)
Nahoru