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 17 items.
- An SMT solver for regular expressions and linear arithmetic over string length (Q832270) (← links)
- A formal derivation of the decidability of the theory SA (Q1325831) (← links)
- Deciding the word problem in the union of equational theories. (Q1400706) (← links)
- Solvability of context equations with two context variables is decidable (Q1599536) (← 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)
- First-order concatenation theory with bounded quantifiers (Q2219089) (← links)
- Towards more efficient methods for solving regular-expression heavy string constraints (Q2680985) (← links)
- Definability in the Existential Theory of Concatenation and Undecidable Extensions of this Theory (Q3773843) (← links)
- A decidable word problem without equivalent canonical term rewriting system (Q3816049) (← links)
- (Q3839876) (← links)
- How to prove decidability of equational theories with second-order computation analyser SOL (Q5110922) (← links)
- A decision procedure for string constraints with string/integer conversion and flat regular constraints (Q6150112) (← 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)
