PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Godoy, Guillem"

Author of the publication

copydeleteadd this publication to your clipboard
Deciding confluence of certain term rewriting systems in polynomial time.

, , and . Ann. Pure Appl. Logic, 130 (1-3): 33-59 (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Guillem Garrofé Montoliu University of Stuttgart

 

Other publications of authors with the same name

Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories, , , , and . Logical Methods in Computer Science, (2013)Orderings for Innermost Termination., , and . RTA, volume 3467 of Lecture Notes in Computer Science, page 17-31. Springer, (2005)Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems., and . RTA, volume 4533 of Lecture Notes in Computer Science, page 184-199. Springer, (2007)One-context Unification with STG-Compressed Terms is in NP., , and . RTA, volume 15 of LIPIcs, page 149-164. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2012)Termination of Rewriting with Right-Flat Rules., , and . RTA, volume 4533 of Lecture Notes in Computer Science, page 200-213. Springer, (2007)On the Confluence of Linear Shallow Term Rewrite Systems., , and . STACS, volume 2607 of Lecture Notes in Computer Science, page 85-96. Springer, (2003)Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete., , and . SIAM J. Comput., 40 (2): 446-464 (2011)Emptiness and Finiteness for Tree Automata with Global Reflexive Disequality Constraints., , and . J. Autom. Reasoning, 51 (4): 371-400 (2013)Normalization properties for Shallow TRS and Innermost Rewriting.. Appl. Algebra Eng. Commun. Comput., 21 (2): 109-129 (2010)Automatic Evaluation of Reductions between NP-Complete Problems., , and . SAT, volume 8561 of Lecture Notes in Computer Science, page 415-421. Springer, (2014)