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
Classes of Tree Homomorphisms with Decidable Preservation of Regularity.

, , and . FoSSaCS, volume 4962 of Lecture Notes in Computer Science, page 127-141. Springer, (2008)

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

Constraint Solving for Term Orderings Compatible with Abelian Semigroups, Monoids and Groups., and . Constraints, 9 (3): 167-192 (2004)Learning Theory through Videos - A Teaching Experience in a Theoretical Course based on Self-learning Videos and Problem-solving Sessions., , , and . CSEDU (2), page 93-98. SciTePress, (2011)The Confluence of Ground Term Rewrite Systems is Decidable in Polynomial Time., , and . FOCS, page 298-307. IEEE Computer Society, (2001)Context Matching for Compressed Terms., , and . LICS, page 93-102. IEEE Computer Society, (2008)Classes of Tree Homomorphisms with Decidable Preservation of Regularity., , and . FoSSaCS, volume 4962 of Lecture Notes in Computer Science, page 127-141. Springer, (2008)Automatic Evaluation of Reductions between NP-Complete Problems., , and . SAT, volume 8561 of Lecture Notes in Computer Science, page 415-421. Springer, (2014)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)Recursive Path Orderings Can Also Be Incremental., , and . LPAR, volume 3835 of Lecture Notes in Computer Science, page 230-245. Springer, (2005)Tree Automata with Height Constraints between Brothers., and . RTA-TLCA, volume 8560 of Lecture Notes in Computer Science, page 149-163. Springer, (2014)Deciding confluence of certain term rewriting systems in polynomial time., , and . Ann. Pure Appl. Logic, 130 (1-3): 33-59 (2004)