Pages that link to "Item:Q3583578"

The following pages link to Satisfiability of word equations with constants is in PSPACE (Q3583578):

Displaying 42 items.

• One-variable word equations in linear time (Q261339) (← links)
• Finding all solutions of equations in free groups and monoids with involution (Q342722) (← links)
• An efficient SMT solver for string constraints (Q518402) (← links)
• Z3str2: an efficient solver for strings, regular expressions, and length constraints (Q526767) (← links)
• On the complexity of decidable cases of the commutation problem of languages (Q557812) (← links)
• An SMT solver for regular expressions and linear arithmetic over string length (Q832270) (← links)
• \(\forall \exists^{5}\)-equational theory of context unification is undecidable (Q1607219) (← links)
• Systems of word equations, polynomials and linear algebra: a new approach (Q1631611) (← links)
• On equations and first-order theory of one-relator monoids (Q2051781) (← links)
• The complexity of solution sets to equations in hyperbolic groups (Q2130524) (← links)
• Word equations in the context of string solving (Q2163975) (← links)
• Word equations in non-deterministic linear space (Q2237894) (← links)
• The complexity of compressed membership problems for finite automata (Q2254509) (← links)
• On systems of word equations over three unknowns with at most six occurrences of one of the unknowns (Q2271428) (← links)
• On PSPACE generation of a solution set of a word equation and its applications (Q2326385) (← links)
• On the complexity of computation maximal exponent of periodicity of word equations and expressible relations (note) (Q2326386) (← links)
• Equations over free inverse monoids with idempotent variables (Q2411041) (← links)
• On maximal chains of systems of word equations (Q2510762) (← links)
• The existential theory of equations with rational constraints in free groups is PSPACE-complete (Q2573633) (← links)
• The non-parametrizability of the word equation \(xyz=zvx\): a short proof (Q2575750) (← links)
• Regular matching and inclusion on compressed tree patterns with constrained context variables (Q2672652) (← links)
• More Than 1700 Years of Word Equations (Q2947143) (← links)
• A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings (Q2964458) (← links)
• Equations in the Partial Semigroup of Words with Overlapping Products (Q3166946) (← links)
• Chain-Free String Constraints (Q3297597) (← links)
• Solutions to twisted word equations and equations in virtually free groups (Q3299596) (← links)
• What Is Essential Unification? (Q3305325) (← links)
• SOLVABILITY OF EQUATIONS IN GRAPH GROUPS IS DECIDABLE (Q3430310) (← links)
• ON NON-PERIODIC SOLUTIONS OF INDEPENDENT SYSTEMS OF WORD EQUATIONS OVER THREE UNKNOWNS (Q3503102) (← links)
• WORD EQUATIONS OVER GRAPH PRODUCTS (Q3521473) (← links)
• An Analysis and a Reproof of Hmelevskii’s Theorem (Q3533033) (← links)
• Towards Decidability of Conjugacy of Pairs and Triples (Q3601812) (← links)
• Solving one-variable equations in free groups (Q3619537) (← links)
• On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations (Q3637246) (← links)
• (Q5091272) (← links)
• (Q5092324) (← links)
• Graph Logics with Rational Relations (Q5278208) (← links)
• POLYNOMIAL-TIME COMPLEXITY FOR INSTANCES OF THE ENDOMORPHISM PROBLEM IN FREE GROUPS (Q5297787) (← links)
• (Q5376657) (← links)
• A solver for arrays with concatenation (Q6156632) (← links)
• First steps towards taming description logics with strings (Q6545544) (← links)
• Languages generated by conjunctive query fragments of FC[REG] (Q6661764) (← links)