| Bibliography | Diekert, Volker; Lohrey, Markus: Existential and Positive Theories of Equations in Graph Products.
University of Stuttgart, Faculty of Computer Science, Technical Report No. 2001/10.
20 pages, english.
|
|---|
| CR-Schema | F.4.2 (Grammars and Other Rewriting Systems)
F.4.3 (Formal Languages)
|
|---|
| Abstract | 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.
|
|---|
Full text and
other links | PostScript (349868 Bytes)
|
|---|
| Contact | lohrey@informatik.uni-stuttgart.de |
|---|
| Department(s) | University of Stuttgart, Institute of Computer Science, Theoretical Computer Science
|
|---|
| Entry date | December 14, 2001 |
|---|