Word equations in nondeterministic linear space
From MaRDI portal
Publication:5111427
DOI10.4230/LIPICS.ICALP.2017.95zbMATH Open1442.68094arXiv1702.00736MaRDI QIDQ5111427FDOQ5111427
Authors: Artur Jeż 
Publication date: 27 May 2020
Full work available at URL: https://arxiv.org/abs/1702.00736
Recommendations
Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42)
Cited In (18)
- On equations and first-order theory of one-relator monoids
- An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences
- Title not available (Why is that?)
- The complexity of solution sets to equations in hyperbolic groups
- On PSPACE generation of a solution set of a word equation and its applications
- Equations in words: An algorithmic contribution
- Monadic decomposition in integer linear arithmetic
- String theories involving regular membership predicates: from practice to theory and back
- On the structure of solution-sets to regular word equations
- Towards more efficient methods for solving regular-expression heavy string constraints
- One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations
- The non-parametrizability of the word equation \(xyz=zvx\): a short proof
- Word equations in non-deterministic linear space
- Makanin's algorithm for word equations-two improvements and a generalization
- Title not available (Why is that?)
- The Diophantine problem in the classical matrix groups
- Solutions to twisted word equations and equations in virtually free groups
- Title not available (Why is that?)
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)
