Pages that link to "Item:Q6109598"
From MaRDI portal
The following pages link to Quadratic word equations with length constraints, counter systems, and Presburger arithmetic with divisibility (Q6109598):
Displaying 10 items.
- An SMT solver for regular expressions and linear arithmetic over string length (Q832270) (← links)
- The satisfiability of word equations: decidable and undecidable theories (Q1798903) (← links)
- On equations and first-order theory of one-relator monoids (Q2051781) (← links)
- Monadic decomposition in integer linear arithmetic (Q2096441) (← links)
- Equations over the \(k\)-binomial monoids (Q2140471) (← links)
- Towards more efficient methods for solving regular-expression heavy string constraints (Q2680985) (← links)
- (Q5092406) (← links)
- A closer look at the expressive power of logics based on word equations (Q6580075) (← links)
- On the structure of solution-sets to regular word equations (Q6614609) (← links)
- Program specialization as a tool for solving word equations (Q6646292) (← links)
