( en | de | ru )

 

Disambiguation of "Godoy, Guillem"

Author of the publication

copydeleteadd this publication to your clipboard
Emptiness and Finiteness for Tree Automata with Global Reflexive Disequality Constraints.

, , and . J. Autom. Reason., 51 (4): 371-400 (2013)

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 Usandizaga

Maren Rebolledo Godoy

Juan Miquel Godoy Ramsay

Fliesslochformen und Gewindefurchen in dünne Bleche und Rohre aus Kupfer und Kupferlegierungen. Uni Kassel, (2009)

Alejandra Godoy-Haeberle

José Rodrigo Godoy Berthet

 

Other publications of authors with the same name

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)Emptiness and Finiteness for Tree Automata with Global Reflexive Disequality Constraints., , and . J. Autom. Reason., 51 (4): 371-400 (2013)On the Confluence of Linear Shallow Term Rewrite Systems., , and . STACS, volume 2607 of Lecture Notes in Computer Science, page 85-96. Springer, (2003)Orderings for Innermost Termination., , and . RTA, volume 3467 of Lecture Notes in Computer Science, page 17-31. Springer, (2005)Termination of Rewriting with Right-Flat Rules., , and . RTA, volume 4533 of Lecture Notes in Computer Science, page 200-213. 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 für Informatik, (2012)Normalization properties for Shallow TRS and Innermost Rewriting.. Appl. Algebra Eng. Commun. Comput., 21 (2): 109-129 (2010)On the Normalization and Unique Normalization Properties of Term Rewrite Systems., and . CADE, volume 4603 of Lecture Notes in Computer Science, page 247-262. Springer, (2007)Automatic Evaluation of Reductions between NP-Complete Problems., , and . SAT, volume 8561 of Lecture Notes in Computer Science, page 415-421. Springer, (2014)Deciding confluence of certain term rewriting systems in polynomial time., , and . Ann. Pure Appl. Log., 130 (1-3): 33-59 (2004)