Adrià Gascón

Available identifiers

zbMath Open gascon.adriaMaRDI QIDQ1041588

List of research outcomes

Publication	Date of Publication	Type
Look for the proof to find the program: decorated-component-based program synthesis	2022-08-12	Paper
One-context Unification with STG-Compressed Terms is in NP	2020-05-27	Paper
Grammar-based compression of unranked trees	2020-02-27	Paper
Grammar-based compression of unranked trees	2018-11-28	Paper
One Context Unification Problems Solvable in Polynomial Time	2018-04-23	Paper
Two-Restricted One Context Unification is in Polynomial Time	2017-08-31	Paper
The HOM Problem is EXPTIME-Complete	2017-05-16	Paper
The HOM Problem is EXPTIME-Complete	2016-08-16	Paper
Program Synthesis Using Dual Interpretation	2015-12-02	Paper
Unification and matching on compressed terms	2015-09-17	Paper
Emptiness and finiteness for tree automata with global reflexive disequality constraints	2015-06-23	Paper
Closure of Tree Automata Languages under Innermost Rewriting	2014-07-22	Paper
First-Order Unification on Compressed Terms	2012-04-24	Paper
Context unification with one context variable	2009-12-03	Paper
Unification with Singleton Tree Grammars	2009-06-30	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Adrià Gascón