Word equations in nondeterministic linear space
From MaRDI portal
Publication:5111427
Recommendations
Cited in
(22)- On equations and first-order theory of one-relator monoids
- String theories involving regular membership predicates: from practice to theory and back
- scientific article; zbMATH DE number 7561615 (Why is no real title available?)
- Recompression: word equations and beyond
- Recompression: technique for word equations and compressed data
- One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations
- Towards more efficient methods for solving regular-expression heavy string constraints
- An optimal bound on the solution sets of one-variable word equations and its consequences
- On the structure of solution-sets to regular word equations
- scientific article; zbMATH DE number 7561603 (Why is no real title available?)
- Recompression: a simple and powerful technique for word equations
- On PSPACE generation of a solution set of a word equation and its applications
- scientific article; zbMATH DE number 7561688 (Why is no real title available?)
- Equations in words: An algorithmic contribution
- The Diophantine problem in the classical matrix groups
- The non-parametrizability of the word equation \(xyz=zvx\): a short proof
- Monadic decomposition in integer linear arithmetic
- Solutions to twisted word equations and equations in virtually free groups
- Word equations in non-deterministic linear space
- The complexity of solution sets to equations in hyperbolic groups
- Makanin's algorithm for word equations-two improvements and a generalization
- Satisfiability of word equations with constants is in NEXPTIME
This page was built for publication: Word equations in nondeterministic linear space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111427)
