Pages that link to "Item:Q1798903"
From MaRDI portal
The following pages link to The satisfiability of word equations: decidable and undecidable theories (Q1798903):
Displaying 6 items.
- An SMT solver for regular expressions and linear arithmetic over string length (Q832270) (← links)
- On equations and first-order theory of one-relator monoids (Q2051781) (← links)
- String theories involving regular membership predicates: from practice to theory and back (Q2140459) (← links)
- Equations over the \(k\)-binomial monoids (Q2140471) (← links)
- Word equations in the context of string solving (Q2163975) (← links)
- A decision procedure for string constraints with string/integer conversion and flat regular constraints (Q6150112) (← links)
