Guillem Godoy

Comput. Hum. Behav., 2024

2016

The HOM Problem is EXPTIME-Complete.

[BibT_eX]

[DOI]

SIAM J. Comput., 2016

2014

Excessively duplicating patterns represent non-regular languages.

[BibT_eX]

[DOI]

Lander Ramos

Inf. Process. Lett., 2014

Automatic Evaluation of Reductions between NP-Complete Problems.

[BibT_eX]

[DOI]

Pau Fernández

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

Tree Automata with Height Constraints between Brothers.

[BibT_eX]

[DOI]

Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

Automatic Evaluation of Context-Free Grammars (System Description).

[BibT_eX]

[DOI]

Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

2013

Non-Linear Rewrite Closure and Weak Normalization.

[BibT_eX]

[DOI]

J. Autom. Reason., 2013

Emptiness and Finiteness for Tree Automata with Global Reflexive Disequality Constraints.

[BibT_eX]

[DOI]

J. Autom. Reason., 2013

The HOM problem is decidable.

[BibT_eX]

[DOI]

Omer Giménez

J. ACM, 2013

Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2013

2012

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

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , 2012

2011

Unification and matching on compressed terms.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2011

Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete.

[BibT_eX]

[DOI]

Omer Giménez

Sebastian Maneth

SIAM J. Comput., 2011

Learning Theory through Videos - A Teaching Experience in a Theoretical Course based on Self-learning Videos and Problem-solving Sessions.

[BibT_eX]

Proceedings of the CSEDU 2011, 2011

2010

Context unification with one context variable.

[BibT_eX]

[DOI]

J. Symb. Comput., 2010

Termination of Rewriting with Right-Flat Rules Modulo Permutative Theories

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2010

Normalization properties for Shallow TRS and Innermost Rewriting.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2010

The HOM problem is decidable.

[BibT_eX]

[DOI]

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

The Emptiness Problem for Tree Automata with Global Constraints.

[BibT_eX]

[DOI]

Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

2009

Undecidable properties of flat term rewrite systems.

[BibT_eX]

[DOI]

Hugo Hernández

Appl. Algebra Eng. Commun. Comput., 2009

Invariant Checking for Programs with Procedure Calls.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis, 16th International Symposium, 2009

Unique Normalization for Shallow TRS.

[BibT_eX]

[DOI]

Florent Jacquemard

Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

Unification with Singleton Tree Grammars.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

2008

Closure of Tree Automata Languages under Innermost Rewriting.

[BibT_eX]

[DOI]

Florent Jacquemard

Proceedings of the 8th International Workshop on Reduction Strategies in Rewriting and Programming, 2008

Context Matching for Compressed Terms.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

Classes of Tree Homomorphisms with Decidable Preservation of Regularity.

[BibT_eX]

[DOI]

Sebastian Maneth

Sophie Tison

Proceedings of the Foundations of Software Science and Computational Structures, 2008

2007

Termination of Rewriting with Right-Flat Rules.

[BibT_eX]

[DOI]

Eduard Huntingford

Proceedings of the Term Rewriting and Applications, 18th International Conference, 2007

Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems.

[BibT_eX]

[DOI]

Eduard Huntingford

Proceedings of the Term Rewriting and Applications, 18th International Conference, 2007

On the Normalization and Unique Normalization Properties of Term Rewrite Systems.

[BibT_eX]

[DOI]

Sophie Tison

Proceedings of the Automated Deduction, 2007

2005

Orderings for Innermost Termination.

[BibT_eX]

[DOI]

Mirtha-Lina Fernández

Albert Rubio

Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

Recursive Path Orderings Can Also Be Incremental.

[BibT_eX]

[DOI]

Mirtha-Lina Fernández

Albert Rubio

Proceedings of the Logic for Programming, 2005

Confluence of Shallow Right-Linear Rewrite Systems.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 19th International Workshop, 2005

Termination of Rewrite Systems with Shallow Right-Linear, Collapsing, and Right-Ground Rules.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction, 2005

2004

Classes of term rewrite systems with polynomial confluence problems.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2004

Superposition with completely built-in Abelian groups.

[BibT_eX]

[DOI]

J. Symb. Comput., 2004

Constraint Solving for Term Orderings Compatible with Abelian Semigroups, Monoids and Groups.

[BibT_eX]

[DOI]

Constraints An Int. J., 2004

Deciding confluence of certain term rewriting systems in polynomial time.

[BibT_eX]

[DOI]

Rakesh M. Verma

Ann. Pure Appl. Log., 2004

Characterizing Confluence by Rewrite Closure and Right Ground Term Rewrite Systems.

[BibT_eX]

[DOI]

Rakesh M. Verma

Appl. Algebra Eng. Commun. Comput., 2004

Deciding Fundamental Properties of Right-(Ground or Variable) Rewrite Systems by Rewrite Closure.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning - Second International Joint Conference, 2004

2003

Paramodulation and Knuth-Bendix Completion with Nontotal and Nonmonotonic Orderings.

[BibT_eX]

[DOI]

J. Autom. Reason., 2003

On the Confluence of Linear Shallow Term Rewrite Systems.

[BibT_eX]

[DOI]

Rakesh M. Verma

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

2001

Automated deduction with built-in theories: completeness results and constraint solving techniques.

[BibT_eX]

[DOI]

PhD thesis, 2001

On Ordering Constraints for Deduction with Built-In Abelian Semigroups, Monoids and Groups.

[BibT_eX]

[DOI]

Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

On the Completeness of Arbitrary Selection Strategies for Paramodulation.

[BibT_eX]

[DOI]

Miquel Bofill

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

The Confluence of Ground Term Rewrite Systems is Decidable in Polynomial Time.

[BibT_eX]

[DOI]

Hubert Comon

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000

Paramodulation with Built-in Abelian Groups.

[BibT_eX]

[DOI]