From post

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.

 

Другие публикации лиц с тем же именем

Termination of Rewriting with Right-Flat Rules., , и . RTA, том 4533 из Lecture Notes in Computer Science, стр. 200-213. Springer, (2007)One-context Unification with STG-Compressed Terms is in NP., , и . RTA, том 15 из LIPIcs, стр. 149-164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)Emptiness and Finiteness for Tree Automata with Global Reflexive Disequality Constraints., , и . J. Autom. Reason., 51 (4): 371-400 (2013)Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems., и . RTA, том 4533 из Lecture Notes in Computer Science, стр. 184-199. Springer, (2007)Orderings for Innermost Termination., , и . RTA, том 3467 из Lecture Notes in Computer Science, стр. 17-31. Springer, (2005)Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete., , и . SIAM J. Comput., 40 (2): 446-464 (2011)Normalization properties for Shallow TRS and Innermost Rewriting.. Appl. Algebra Eng. Commun. Comput., 21 (2): 109-129 (2010)On the Confluence of Linear Shallow Term Rewrite Systems., , и . STACS, том 2607 из Lecture Notes in Computer Science, стр. 85-96. Springer, (2003)Characterizing Confluence by Rewrite Closure and Right Ground Term Rewrite Systems., , и . Appl. Algebra Eng. Commun. Comput., 15 (1): 13-36 (2004)Deciding confluence of certain term rewriting systems in polynomial time., , и . Ann. Pure Appl. Log., 130 (1-3): 33-59 (2004)