English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  Recompression: A Simple and Powerful Technique for Word Equations

Jeż, A. (2013). Recompression: A Simple and Powerful Technique for Word Equations. In N. Portier, & T. Wilke (Eds.), 30th International Symposium on Theoretical Aspects of Computer Science (pp. 233-244). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.STACS.2013.233.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0015-3F2C-7 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-55B6-6
Genre: Conference Paper

Files

show Files
hide Files
:
25.pdf (Any fulltext), 533KB
 
File Permalink:
-
Name:
25.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show
hide
Locator:
http://drops.dagstuhl.de/opus/volltexte/2013/3937/ (Any fulltext)
Description:
-
OA-Status:

Creators

show
hide
 Creators:
Jeż, Artur1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: We present an application of a local recompression technique, previously developed by the author in the context of compressed membership problems and compressed pattern matching, to word equations. The technique is based on local modification of variables (replacing X by aX or Xa) and replacement of pairs of letters appearing in the equation by a `fresh' letter, which can be seen as a bottom-up compression of the solution of the given word equation, to be more specific, building an SLP (Straight-Line Programme) for the solution of the word equation. Using this technique we give new self-contained proofs of many known results for word equations: the presented nondeterministic algorithm runs in O(n \log n) space and in time polynomial in \log N and n, where N is the size of the length-minimal solution of the word equation. It can be easily generalised to a generator of all solutions of the word equation. A further analysis of the algorithm yields a doubly exponential upper bound on the size of the length-minimal solution. The presented algorithm does not use exponential bound on the exponent of periodicity. Conversely, the analysis of the algorithm yields a new proof of the exponential bound on exponent of periodicity. For O(1) variables with arbitrary many appearances it works in linear space.

Details

show
hide
Language(s): eng - English
 Dates: 2013-02-18
 Publication Status: Published online
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: Other: Local-ID: 46A2F9168BACE6DEC1257B1D0053AE6C-Jez2013STACS
DOI: 10.4230/LIPIcs.STACS.2013.233
BibTex Citekey: Jez2013STACS
URN: urn:nbn:de:0030-drops-39376
 Degree: -

Event

show
hide
Title: 30th International Symposium on Theoretical Aspects of Computer Science
Place of Event: Kiel, Germany
Start-/End Date: 2013-02-27 - 2013-03-03

Legal Case

show

Project information

show

Source 1

show
hide
Title: 30th International Symposium on Theoretical Aspects of Computer Science
  Abbreviation : STACS 2013
Source Genre: Proceedings
 Creator(s):
Portier, Natacha1, Editor
Wilke, Thomas1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Wadern : Schloss Dagstuhl
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 233 - 244 Identifier: ISBN: 978-3-939897-50-7

Source 2

show
hide
Title: Leibniz International Proceedings in Informatics
  Abbreviation : LIPIcs
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 20 Sequence Number: - Start / End Page: - Identifier: ISSN: 1868-8969