Zur Kurzanzeige

dc.date.accessioned2008-11-18T08:31:39Z
dc.date.available2008-11-18T08:31:39Z
dc.date.issued2008-11-18T08:31:39Z
dc.identifier.uriurn:nbn:de:hebis:34-2008111825149
dc.identifier.urihttp://hdl.handle.net/123456789/2008111825149
dc.format.extent265090 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoeng
dc.rightsUrheberrechtlich geschützt
dc.rights.urihttps://rightsstatements.org/page/InC/1.0/
dc.subjectanalysis by reductioneng
dc.subjectrestarting automatoneng
dc.subjectparallel communicating grammar systemeng
dc.subjectgeneration complexityeng
dc.subjectdistribution complexityeng
dc.subjectcharacteristic analysiseng
dc.subject.ddc004
dc.titleOn Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automataeng
dc.typeTechnischer Report
dcterms.abstractThis 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.eng
dcterms.accessRightsopen access
dcterms.creatorPardubská, Dana
dcterms.creatorPlátek, Martin
dcterms.creatorOtto, Friedrich
dcterms.isPartOfKasseler Informatikschriften ;; 2008, 4ger
dc.subject.ccsF.1.1
dc.subject.ccsF.4.3
dcterms.source.seriesKasseler Informatikschriftenger
dcterms.source.volume2008, 4ger


Dateien zu dieser Ressource

Thumbnail

Das Dokument erscheint in:

Zur Kurzanzeige