First-Order Unification on Compressed Terms

DOI10.4230/LIPIcs.RTA.2011.51zbMath1236.68129OpenAlexW2151885154MaRDI QIDQ5389071

Adrià Gascón, Lander Ramos, Sebastian Maneth

Publication date: 24 April 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_8911.html

zbMATH Keywords

matchingcompressionunificationgrammarsSTGsystem C++

Mathematics Subject Classification ID

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

Related Items (2)

Congruence Closure of Compressed Terms in Polynomial Time ⋮ Parameter reduction and automata evaluation for grammar-compressed trees

This page was built for publication: First-Order Unification on Compressed Terms