Author of the publication

Excessively duplicating patterns represent non-regular languages.

, , and . Inf. Process. Lett., 114 (3): 85-93 (2014)

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.

 

Other publications of authors with the same name

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)Emptiness and Finiteness for Tree Automata with Global Reflexive Disequality Constraints., , and . J. Autom. Reason., 51 (4): 371-400 (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)Termination of Rewriting with Right-Flat Rules., , and . RTA, volume 4533 of Lecture Notes in Computer Science, page 200-213. Springer, (2007)Normalization properties for Shallow TRS and Innermost Rewriting.. Appl. Algebra Eng. Commun. Comput., 21 (2): 109-129 (2010)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)On the Confluence of Linear Shallow Term Rewrite Systems., , and . STACS, volume 2607 of Lecture Notes in Computer Science, page 85-96. Springer, (2003)Tree Automata with Height Constraints between Brothers., and . RTA-TLCA, volume 8560 of Lecture Notes in Computer Science, page 149-163. Springer, (2014)Classes of Tree Homomorphisms with Decidable Preservation of Regularity., , and . FoSSaCS, volume 4962 of Lecture Notes in Computer Science, page 127-141. Springer, (2008)