Word equations in the context of string solving
From MaRDI portal
Publication:2163975
DOI10.1007/978-3-031-05578-2_2OpenAlexW4285183559MaRDI QIDQ2163975
Publication date: 11 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-05578-2_2
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- One-variable word equations in linear time
- Finding all solutions of equations in free groups and monoids with involution
- Lyndon words formalized in Isabelle/HOL
- Equations in free semigroups
- On the independence of equations in three variables.
- Regular patterns, regular languages and context-free languages
- On the equation \(x^k=z_1^{k_1}z_2^{k_2}\cdots z_n^{k_n}\) in a free semigroup
- The satisfiability of word equations: decidable and undecidable theories
- Undecidability of the positive \(\forall\exists^ 3\)-theory of a free semigroup
- Word equations in non-deterministic linear space
- A logic for document spanners
- On solving word equations using SAT
- Algebraic properties of word equations
- On systems of word equations with simple loop sets
- Word equations with \(k\)th powers of variables
- On maximal chains of systems of word equations
- The existential theory of equations with rational constraints in free groups is PSPACE-complete
- The non-parametrizability of the word equation \(xyz=zvx\): a short proof
- Two-variable word equations
- Satisfiability of word equations with constants is in NEXPTIME
- Solution sets for equations over free groups are EDT0L languages
- String solving with word equations and transducers: towards a logic for analysing mutation XSS
- An efficient algorithm for solving word equations
- More Than 1700 Years of Word Equations
- EQUATIONS IN A FREE GROUP
- WORD EQUATIONS WITH ONE UNKNOWN
- Recompression
- INTRICACIES OF SIMPLE WORD EQUATIONS: AN EXAMPLE
- Foliations for solving equations in groups: free, virtually free, and hyperbolic groups
- Visibly pushdown languages
- Satisfiability of word equations with constants is in PSPACE
- Path Feasibility Analysis for String-Manipulating Programs
- DECIDABILITY OF THE UNIVERSAL AND POSITIVE THEORIES OF A FREE GROUP
- The expressibility of languages and relations by word equations
- On the Complexity of Solving Restricted Word Equations
- One-Variable Word Equations and Three-Variable Constant-Free Word Equations
- An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences
- The hardness of solving simple word equations
- Graph Logics with Rational Relations
- Mathematical Foundations of Computer Science 2004
- Automata, Languages and Programming
- Concatenation as a basis for arithmetic
- Makanin's algorithm for word equations-two improvements and a generalization
This page was built for publication: Word equations in the context of string solving
