Abstract
Word equations are combinatorial equalities between strings of symbols, variables and functions, which can be used to model problems in a wide range of domains. While some complexity results for the solving of specific classes of equations are known, currently there does not exist any equation solver publicly available. Recently, we have proposed the implementation of such a solver based on Boolean satisfiability that leverages existing SAT solvers for this purpose. In this paper, we propose a new representation of equations on words having fixed length, by using an enriched graph data structure. We discuss the implementation as well as experimental results obtained on a sample of equations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abdulrab, H.: Implementation of Makanin’s algorithm. In: Schulz, K.U. (ed.) IWWERT 1990. LNCS, vol. 572, pp. 61–84. Springer, Heidelberg (1992)
Blondin Massé, A., Garon, A., Labbé, S.: Generation of double square tiles. Theoretical Computer Science (2012) (to appear)
Brlek, S.: Interactions between digital geometry and combinatorics on words. In: Ambroz, P., Holub, S., Masáková, Z. (eds.) WORDS. EPTCS, vol. 63, pp. 1–12 (2011)
Eén, N., Sörensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502–518. Springer, Heidelberg (2004)
Fraenkel, A.S., Simpson, J.: How many squares can a string contain? Journal of Combinatorial Theory, Series A 82(1), 112 – 120 (1998), http://www.sciencedirect.com/science/article/pii/S0097316597928430
Fu, X., Li, C.-C.: A string constraint solver for detecting web application vulnerability. In: SEKE, pp. 535–542. Knowledge Systems Institute Graduate School (2010)
Gusfield, D.: Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge Univ. Press (January 2007), http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20&path=ASIN/0521585198
Kiezun, A., Ganesh, V., Artzi, S., Guo, P., Hooimeijer, P., Ernst, M.: HAMPI: A solver for word equations over strings, regular expressions and context-free grammars. ACM Trans. on Software Engineering and Methodology 21(4) (2012) (to appear)
Kiezun, A., Ganesh, V., Guo, P.J., Hooimeijer, P., Ernst, M.D.: Hampi: a solver for string constraints. In: Rothermel, G., Dillon, L.K. (eds.) ISSTA, pp. 105–116. ACM (2009)
Larouche, M., Blondin Mass, A., Gaboury, S., Hall, S.: Solving equations on words through Boolean satisfiability. In: Maldonado, J.C., Shin, S.Y. (eds.) SAC, pp. 104–106. ACM (2013)
Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press (2002)
Lothaire, M.: Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications). Cambridge University Press, New York (2005)
Makanin, G.: The problem of solvability of equations in a free semigroup. Mathematics of the USSR-Sbornik 32(2), 129 (1977)
Plandowski, W.: Satisfiability of word equations with constants is in PSPACE. In: FOCS, pp. 495–500. IEEE Computer Society (1999)
Yu, F., Bultan, T., Ibarra, O.H.: Relational string verification using multi-track automata. Int. J. Found. Comput. Sci. 22(8), 1909–1924 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Blondin Massé, A., Gaboury, S., Hallé, S., Larouche, M. (2014). Solving Equations on Words with Morphisms and Antimorphisms. In: Dediu, AH., Martín-Vide, C., Sierra-Rodríguez, JL., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2014. Lecture Notes in Computer Science, vol 8370. Springer, Cham. https://doi.org/10.1007/978-3-319-04921-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-04921-2_15
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-04920-5
Online ISBN: 978-3-319-04921-2
eBook Packages: Computer ScienceComputer Science (R0)