Author of the publication

Termination of linear bounded term rewriting systems.

, , and . RTA, volume 6 of LIPIcs, page 341-356. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)

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

Some Undecidable Termination Problems for Semi-Thue Systems (Abstract).. RTA, volume 690 of Lecture Notes in Computer Science, page 434. Springer, (1993)Some Applications of the Decidability of DPDA's Equivalence.. MCU, volume 2055 of Lecture Notes in Computer Science, page 114-132. Springer, (2001)Equations over Free Inverse Monoids with Idempotent Variables., , , and . CSR, volume 9139 of Lecture Notes in Computer Science, page 173-188. Springer, (2015)Iterated pushdown automata and sequences of rational numbers., and . Ann. Pure Appl. Log., 141 (3): 363-411 (2006)A Polynomial Algorithm Testing Partial Confluence of Basic Semi-Thue Systems.. RTA, volume 914 of Lecture Notes in Computer Science, page 194-209. Springer, (1995)On the Termination Problem for One-Rule Semi-Thue System.. RTA, volume 1103 of Lecture Notes in Computer Science, page 302-316. Springer, (1996)The Obstructions of a Minor-Closed Set of Graphs Defined by Hyperedge Replacement can be Constructed., and . TAGT, volume 1073 of Lecture Notes in Computer Science, page 351-367. Springer, (1994)An Effective Version of Stallings' Theorem in the Case of Context-Free Groups.. ICALP, volume 700 of Lecture Notes in Computer Science, page 478-495. Springer, (1993)Decidability of Bisimulation Equivalence for Equational Graphs of Finite Out-Degree.. FOCS, page 120-129. IEEE Computer Society, (1998)The Bisimulation Problem for equational graphs of finite out-degree. CoRR, (2000)