Zur Kurzanzeige

dc.date.accessioned2006-04-03T13:36:10Z
dc.date.available2006-04-03T13:36:10Z
dc.date.issued2005
dc.identifier.uriurn:nbn:de:hebis:34-200604038969
dc.identifier.urihttp://hdl.handle.net/123456789/200604038969
dc.format.extent265248 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoeng
dc.publisherUniversität Kassel, FB 17, Mathematik/Informatikeng
dc.rightsUrheberrechtlich geschützt
dc.rights.urihttps://rightsstatements.org/page/InC/1.0/
dc.subjectTheoretische Informatikeng
dc.subjectRestart-Automateneng
dc.subjectRewriting Restarting Automataeng
dc.subject.ddc004
dc.titleDegrees of Free Word-Order and Freely Rewriting Restarting Automataeng
dc.typePreprint
dcterms.abstractIn natural languages with a high degree of word-order freedom syntactic phenomena like dependencies (subordinations) or valencies do not depend on the word-order (or on the individual positions of the individual words). This means that some permutations of sentences of these languages are in some (important) sense syntactically equivalent. Here we study this phenomenon in a formal way. Various types of j-monotonicity for restarting automata can serve as parameters for the degree of word-order freedom and for the complexity of word-order in sentences (languages). Here we combine two types of parameters on computations of restarting automata: 1. the degree of j-monotonicity, and 2. the number of rewrites per cycle. We study these notions formally in order to obtain an adequate tool for modelling and comparing formal descriptions of (natural) languages with different degrees of word-order freedom and word-order complexity.eng
dcterms.accessRightsopen access
dcterms.creatorMráz, František
dcterms.creatorOtto, Friedrich
dcterms.creatorPlátek, Martin
dcterms.isPartOfMathematische Schriften Kasseleng
dcterms.isPartOf05, 05eng
dcterms.source.journalMathematische Schriften Kassel
dcterms.source.volume05, 05


Dateien zu dieser Ressource

Thumbnail

Das Dokument erscheint in:

Zur Kurzanzeige