The satisfiability of word equations: decidable and undecidable theories
From MaRDI portal
Publication:1798903
DOI10.1007/978-3-030-00250-3_2OpenAlexW2889237106MaRDI QIDQ1798903
Paul He, Vijay Ganesh, Dirk Nowotka, Florin Manea, Joel D. Day
Publication date: 23 October 2018
Full work available at URL: https://doi.org/10.1007/978-3-030-00250-3_2
Related Items
An SMT solver for regular expressions and linear arithmetic over string length, String theories involving regular membership predicates: from practice to theory and back, Equations over the \(k\)-binomial monoids, Word equations in the context of string solving, Towards more efficient methods for solving regular-expression heavy string constraints, A decision procedure for string constraints with string/integer conversion and flat regular constraints, First-order concatenation theory with bounded quantifiers, On equations and first-order theory of one-relator monoids
Uses Software
