Existential and Positive Theories of Equations in Graph Products | Zendy

Volker Diekert | Zendy; Markus Lohrey | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Existential and Positive Theories of Equations in Graph Products

Author(s) -

Volker Diekert,

Markus Lohrey

Publication year - 2002

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

DOI - 10.1007/3-540-45841-7_41

Subject(s) - decidability , graph , finite graph , free product , mathematics , product (mathematics) , graph theory , discrete mathematics , algebra over a field , pure mathematics , combinatorics , group (periodic table) , geometry , chemistry , organic chemistry

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research