scientific article
From MaRDI portal
Publication:2957887
DOI10.4230/LIPIcs.STACS.2013.233zbMath1354.68307arXiv1203.3705MaRDI QIDQ2957887
Publication date: 30 January 2017
Full work available at URL: https://arxiv.org/abs/1203.3705
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)
Related Items (8)
Equality Testing of Compressed Strings ⋮ Solution Sets for Equations over Free Groups are EDT0L Languages ⋮ Equations over free inverse monoids with idempotent variables ⋮ More Than 1700 Years of Word Equations ⋮ Approximation of grammar-based compression via recompression ⋮ The complexity of compressed membership problems for finite automata ⋮ Unnamed Item ⋮ One-variable word equations in linear time
This page was built for publication:
