Existential and positive theories of equations in graph products

dc.contributor.authorDiekert, Volkerde
dc.contributor.authorLohrey, Markusde
dc.date.accessioned2002-01-29de
dc.date.accessioned2016-03-31T07:58:17Z
dc.date.available2002-01-29de
dc.date.available2016-03-31T07:58:17Z
dc.date.issued2001de
dc.date.updated2013-07-02de
dc.description.abstractWe prove that the existential theory of equations with normalized rational constraints in a fixed graph product of finite monoids, free monoids, and free groups is PSPACE-complete. Under certain restrictions this result also holds if the graph product is part of the input. As the second main result we prove that the positive theory of equations with recognizable constraints in graph products of finite and free groups is decidable.de
dc.identifier.other097161969de
dc.identifier.urihttp://nbn-resolving.de/urn:nbn:de:bsz:93-opus-9916de
dc.identifier.urihttp://elib.uni-stuttgart.de/handle/11682/2497
dc.identifier.urihttp://dx.doi.org/10.18419/opus-2480
dc.language.isoende
dc.relation.ispartofseriesTechnischer Bericht / Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik;2001,10de
dc.rightsinfo:eu-repo/semantics/openAccessde
dc.subject.classificationGrammatik , Formale Sprachede
dc.subject.ddc004de
dc.titleExistential and positive theories of equations in graph productsen
dc.typeworkingPaperde
ubs.fakultaetFakultät Informatik, Elektrotechnik und Informationstechnikde
ubs.institutInstitut für Formale Methoden der Informatikde
ubs.opusid991de
ubs.publikation.typArbeitspapierde
ubs.schriftenreihe.nameTechnischer Bericht / Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnikde

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR-2001-10.pdf
Size:
322.22 KB
Format:
Adobe Portable Document Format