A remark about quadratic trace equations

Authors:
Volker Diekert;Manfred Kufleitner
Affiliations:
Universität Stuttgart, Institut für Formale Methoden der Informatik, Stuttgart, Germany;Universität Stuttgart, Institut für Formale Methoden der Informatik, Stuttgart, Germany
Venue:
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Year:
2002

Citing 5
Cited 0

Recognizing string graphs in NP

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The Book of Traces

The Book of Traces
Application of Lempel-Ziv Encodings to the Solution of Words Equations

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Satisfiability of Word Equations with Constants is in PSPACE

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On quadratic word equations

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a simple PSPACE-algorithm for computing the most general solution of a system of quadratic trace equations with involution. We extend the known linear time algorithm for quadratic word equations with length constraints to cope with involutions. Finally, we show that the same linear-time result cannot be expected for trace equations. We obtain an NP-hardness result.