DSpace
KOBRA
KOBRA

KOBRA - Dokumentenserver der Universität Kassel  → Fachbereiche  → FB 16 Elektrotechnik / Informatik  → Kasseler Informatikschriften (KIS)  

Bitte benutzen Sie diese Kennung, um auf die Ressource zu verweisen:
http://nbn-resolving.de/urn:nbn:de:hebis:34-2008111825149

Titel: On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata
Autor(en): Pardubská, DanaPlátek, MartinOtto, Friedrich
Klassifikation (DDC): 004 - Informatik (Data processing Computer science)
Erscheinungsdatum: 18-Nov-2008
Serie/Report Nr.: Kasseler Informatikschriften2008, 4
Zusammenfassung: This paper contributes to the study of Freely Rewriting Restarting Automata (FRR-automata) and Parallel Communicating Grammar Systems (PCGS), which both are useful models in computational linguistics. For PCGSs we study two complexity measures called 'generation complexity' and 'distribution complexity', and we prove that a PCGS Pi, for which the generation complexity and the distribution complexity are both bounded by constants, can be transformed into a freely rewriting restarting automaton of a very restricted form. From this characterization it follows that the language L(Pi) generated by Pi is semi-linear, that its characteristic analysis is of polynomial size, and that this analysis can be computed in polynomial time.
URI: urn:nbn:de:hebis:34-2008111825149
Sammlung(en):Kasseler Informatikschriften (KIS)

Dateien zu dieser Ressource:

Datei Beschreibung GrößeFormat
Technicalreport2008_4.pdf221,14 kBAdobe PDFÖffnen/Anzeigen

Alle Ressourcen in diesem Repository sind urheberrechtlich geschützt.