Proving Inductive Theorems in Equational Theories. - Dieter Hofbauer; Ralf-Detlef Kutsche (ADT, 1988)

Proving Inductive Theorems Based on Term Rewriting Systems. - Dieter Hofbauer; Ralf-Detlef Kutsche (ALP, 1988)

Grundlagen des maschinellen Beweisens - eine Einführung für Informatiker und Mathematiker. - Dieter Hofbauer; Ralf-Detlef Kutsche (Vieweg, 1989)

Termination Proofs and the Length of Derivations (Preliminary Version). - Dieter Hofbauer; Clemens Lautemann (RTA, 1989)

Time Bounded Rewrite Systems and Termination Proofs by Generalized Embedding. - Dieter Hofbauer (RTA, 1991)

Computing Linearizations Using Test Sets. - Dieter Hofbauer; Maria Huber (CTRS, 1992)

Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation Lengths. - Dieter Hofbauer (Theor. Comput. Sci., 1992)

Termination proofs and derivation lengths in term rewriting systems. - Dieter Hofbauer (1992)

Some Results on Top-Context-Free Tree Languages. - Dieter Hofbauer; Maria Huber; Gregory Kucherov (CAAP, 1994)

Linearizing Term Rewriting Systems Using Test Sets. - Dieter Hofbauer; Maria Huber (J. Symb. Comput., 1994)

Termination Proofs by Context-Dependent Interpretations. - Dieter Hofbauer (RTA, 2001)

Termination Proofs for Ground Rewrite Systems - Interpretations and Derivational Complexity. - Dieter Hofbauer (Appl. Algebra Eng. Commun. Comput., 2001)

Test Sets for the Universal and Existential Closure of Regular Tree Languages. - Dieter Hofbauer; Maria Huber (Inf. Comput., 2002)

An upper bound on the derivational complexity of Knuth-Bendix orderings. - Dieter Hofbauer (Inf. Comput., 2003)

Finding Finite Automata That Certify Termination of String Rewriting. - Alfons Geser; Dieter Hofbauer; Johannes Waldmann; Hans Zantema (CIAA, 2004)

Match-Bounded String Rewriting Systems. - Alfons Geser; Dieter Hofbauer; Johannes Waldmann (Appl. Algebra Eng. Commun. Comput., 2004)

Deleting string rewriting systems preserve regularity. - Dieter Hofbauer; Johannes Waldmann (Theor. Comput. Sci., 2004)

Finding finite automata that certify termination of string rewriting systems. - Alfons Geser; Dieter Hofbauer; Johannes Waldmann; Hans Zantema (Int. J. Found. Comput. Sci., 2005)

Termination Proofs for String Rewriting Systems via Inverse Match-Bounds. - Alfons Geser; Dieter Hofbauer; Johannes Waldmann (J. Autom. Reason., 2005)

On state-alternating context-free grammars. - Etsuro Moriya; Dieter Hofbauer; Maria Huber; Friedrich Otto (Theor. Comput. Sci., 2005)

Termination of String Rewriting with Matrix Interpretations. - Dieter Hofbauer; Johannes Waldmann (RTA, 2006)

Termination of {aa->bc, bb->ac, cc->ab}. - Dieter Hofbauer; Johannes Waldmann (Inf. Process. Lett., 2006)

On tree automata that certify termination of left-linear term rewriting systems. - Alfons Geser; Dieter Hofbauer; Johannes Waldmann; Hans Zantema (Inf. Comput., 2007)

Finding and Certifying Loops. - Harald Zankl; Christian Sternagel; Dieter Hofbauer; Aart Middeldorp (SOFSEM, 2010)

Sparse Tiling Through Overlap Closures for Termination of String Rewriting. - Alfons Geser; Dieter Hofbauer; Johannes Waldmann (FSCD, 2019)

Old and New Benchmarks for Relative Termination of String Rewrite Systems. - Dieter Hofbauer; Johannes Waldmann (CoRR, 2023)

The 19th International Workshop on Termination (WST 2023): Preface, Invited Talk Abstract, and Tool Descriptions. - Akihisa Yamada 002; Benjamin Lucien Kaminski; Dieter Hofbauer; Fred Mesnard; Étienne Payet (CoRR, 2023)