Technischer Bericht TR-2001-10

Bibliograph.
Daten
Diekert, Volker; Lohrey, Markus: Existential and Positive Theories of Equations in Graph Products.
Universität Stuttgart, Fakultät Informatik, Fakultätsbericht Nr. 2001/10.
20 Seiten, englisch.
CR-Klassif.F.4.2 (Grammars and Other Rewriting Systems)
F.4.3 (Formal Languages)
Kurzfassung

We 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.

Volltext und
andere Links
PostScript (349868 Bytes)
Kontaktlohrey@informatik.uni-stuttgart.de
Abteilung(en)Universität Stuttgart, Institut für Informatik, Theoretische Informatik
Eingabedatum14. Dezember 2001
   Publ. Informatik