scientific article; zbMATH DE number 7204547

DOI10.4230/LIPIcs.ICALP.2017.95zbMath1442.68094arXiv1702.00736MaRDI QIDQ5111427

Artur Jeż

Publication date: 27 May 2020

Full work available at URL: https://arxiv.org/abs/1702.00736

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

linear spaceword equationsstring unificationcontext-sensitive languagesspace-efficient computations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (13)

The Diophantine problem in the classical matrix groups ⋮ The complexity of solution sets to equations in hyperbolic groups ⋮ String theories involving regular membership predicates: from practice to theory and back ⋮ Towards more efficient methods for solving regular-expression heavy string constraints ⋮ Solutions to twisted word equations and equations in virtually free groups ⋮ Word equations in non-deterministic linear space ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On equations and first-order theory of one-relator monoids ⋮ On PSPACE generation of a solution set of a word equation and its applications ⋮ Monadic decomposition in integer linear arithmetic ⋮ An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences

This page was built for publication: