Recompression: word equations and beyond

DOI10.1007/978-3-642-38771-5_2MaRDI QIDQ5300826zbMATH OpenOpenAlexFDO

Authors Artur Jeż

Publication date 28 June 2013

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38771-5_2

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 6678923
• Recompression: a simple and powerful technique for word equations
• Recompression: technique for word equations and compressed data
• Word equations in nondeterministic linear space
• Word equations in non-deterministic linear space

Cited in

(12)

• Word equations in non-deterministic linear space
• One-variable word equations in linear time
• scientific article; zbMATH DE number 6678923 (Why is no real title available?)
• Congruence closure of compressed terms in polynomial time
• Recompression: a simple and powerful technique for word equations
• Word equations in nondeterministic linear space
• Context unification is in PSPACE
• SLP compression for solutions of equations with constraints in free and hyperbolic groups.
• Z3str2: an efficient solver for strings, regular expressions, and length constraints
• One-variable word equations in linear time
• Solving word equations (and other unification problems) by recompression (invited talk)
• Recompression: technique for word equations and compressed data

This page was built for publication: Recompression: word equations and beyond

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300826)