One-context Unification with STG-Compressed Terms is in NP

DOI10.4230/LIPICS.RTA.2012.149zbMATH Open1437.68078OpenAlexW1836750303MaRDI QIDQ5111902

Adrià Gascón, Carles Creus, Guillem Godoy

Publication date: 27 May 2020

Full work available at URL: https://dblp.uni-trier.de/db/conf/rta/rta2012.html#CreusGG12

zbMATH Keywords

compressiongrammarsterm unification

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Grammars and rewriting systems (68Q42)

Related Items (4)

Grammar-Based Tree Compression ⋮ Approximation of smallest linear tree grammar ⋮ Grammar-based compression of unranked trees ⋮ Stratified Context Unification Is NP-Complete

This page was built for publication: One-context Unification with STG-Compressed Terms is in NP