In this work, we focus our attention to algorithmic solutions for problems where the instances are presented as straight-line programs on a given algebra. In our exposition, we try to survey general results by presenting some meaningful examples; moreover, where possible, we outline the proofs in order to give an insight of the methods and the techniques. We recall some recent results for the problem PosSLP, consisting of deciding if the integer defined by a straight-line program on the ring Z is greater than zero; we discuss some implications in the areas of numerical analysis and strategic games. Furthermore, we propose some methods for reducing Compressed Word Problem from an algebra to another; reductions from trace monoids to the semiring of nonnegative integers are exhibited and polynomial time algorithms for compressed equivalence in monoids related to Dyck reductions are shown. Finally, we consider inclusion problems for context-free languages, proving how in some cases efficient algorithms for these problems benefit from the ability to work with compressed data.

Source : oai:HAL:hal-00990458v1

Volume: Vol. 12 no. 4

Published on: January 1, 2010

Submitted on: March 26, 2015

Keywords: grammatical compression,computational complexity,algebra representations,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

This page has been seen 83 times.

This article's PDF has been downloaded 204 times.