On the structure of solution sets to regular word equations
From MaRDI portal
Cites work
- A logic for document spanners
- Document spanners: from expressive power to decision problems
- Finding a homomorphism between two words is NP-complete
- Finding all solutions of equations in free groups and monoids with involution
- Finding patterns common to a set of strings
- scientific article; zbMATH DE number 1223734 (Why is no real title available?)
- scientific article; zbMATH DE number 1304322 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 7561688 (Why is no real title available?)
- Makanin's algorithm for word equations-two improvements and a generalization
- Mathematical Foundations of Computer Science 2004
- On the complexity of solving restricted word equations
- Quadratic word equations with length constraints, counter systems, and Presburger arithmetic with divisibility
- Recompression: a simple and powerful technique for word equations
- String solving with word equations and transducers: towards a logic for analysing mutation XSS
- The dag-width of directed graphs
- The expressibility of languages and relations by word equations
- The hardness of solving simple word equations
- THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
- The satisfiability of word equations: decidable and undecidable theories
- Word equations in nondeterministic linear space
Cited in
(2)
This page was built for publication: On the structure of solution sets to regular word equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842446)
