Dieter Hofbauer

33 papers B 3C 2Journal 15Unranked 11
YearRankTypeTitle / Venue / Authors
2023 J jnl
Old and New Benchmarks for Relative Termination of String Rewrite Systems.
CoRR
Dieter Hofbauer, Johannes Waldmann
2023 J jnl
The 19th International Workshop on Termination (WST 2023): Preface, Invited Talk Abstract, and Tool Descriptions.
CoRR
Akihisa Yamada, Benjamin Lucien Kaminski, Dieter Hofbauer, Fred Mesnard, Étienne Payet
2020 J jnl
Sparse Tiling through Overlap Closures for Termination of String Rewriting.
CoRR
Alfons Geser, Dieter Hofbauer, Johannes Waldmann
2019 B conf
Sparse Tiling Through Overlap Closures for Termination of String Rewriting.
FSCD
Alfons Geser, Dieter Hofbauer, Johannes Waldmann
2010 B conf
Finding and Certifying Loops.
SOFSEM
Harald Zankl, Christian Sternagel, Dieter Hofbauer, Aart Middeldorp
2007 J jnl
On tree automata that certify termination of left-linear term rewriting systems.
Inf. Comput.
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema
2006 — conf
Termination of String Rewriting with Matrix Interpretations.
RTA
Dieter Hofbauer, Johannes Waldmann
2006 J jnl
Termination of {
Inf. Process. Lett.
Dieter Hofbauer, Johannes Waldmann
2005 J jnl
Finding finite automata that certify termination of string rewriting systems.
Int. J. Found. Comput. Sci.
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema
2005 — conf
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems.
RTA
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema
2005 J jnl
On state-alternating context-free grammars.
Theor. Comput. Sci.
Etsuro Moriya, Dieter Hofbauer, Maria Huber, Friedrich Otto
2005 J jnl
Termination Proofs for String Rewriting Systems via Inverse Match-Bounds.
J. Autom. Reason.
Alfons Geser, Dieter Hofbauer, Johannes Waldmann
2004 J jnl
Deleting string rewriting systems preserve regularity.
Theor. Comput. Sci.
Dieter Hofbauer, Johannes Waldmann
2004 C conf
Finding Finite Automata That Certify Termination of String Rewriting.
CIAA
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema
2004 J jnl
Match-Bounded String Rewriting Systems.
Appl. Algebra Eng. Commun. Comput.
Alfons Geser, Dieter Hofbauer, Johannes Waldmann
2003 J jnl
An upper bound on the derivational complexity of Knuth-Bendix orderings.
Inf. Comput.
Dieter Hofbauer
2003 C conf
Deleting String Rewriting Systems Preserve Regularity.
Developments in Language Theory
Dieter Hofbauer, Johannes Waldmann
2003 B conf
Match-Bounded String Rewriting Systems.
MFCS
Alfons Geser, Dieter Hofbauer, Johannes Waldmann
2002 J jnl
Test Sets for the Universal and Existential Closure of Regular Tree Languages.
Inf. Comput.
Dieter Hofbauer, Maria Huber
2001 — conf
Termination Proofs by Context-Dependent Interpretations.
RTA
Dieter Hofbauer
2001 J jnl
Termination Proofs for Ground Rewrite Systems - Interpretations and Derivational Complexity.
Appl. Algebra Eng. Commun. Comput.
Dieter Hofbauer
1999 — conf
Test Sets for the Universal and Existential Closure of Regular Tree Languages.
RTA
Dieter Hofbauer, Maria Huber
1994 J jnl
Linearizing Term Rewriting Systems Using Test Sets.
J. Symb. Comput.
Dieter Hofbauer, Maria Huber
1994 — conf
Some Results on Top-Context-Free Tree Languages.
CAAP
Dieter Hofbauer, Maria Huber, Gregory Kucherov
1992 — conf
Computing Linearizations Using Test Sets.
CTRS
Dieter Hofbauer, Maria Huber
1992 J jnl
Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation Lengths.
Theor. Comput. Sci.
Dieter Hofbauer
1992 — —
Termination proofs and derivation lengths in term rewriting systems.
Dieter Hofbauer
1991 — conf
Time Bounded Rewrite Systems and Termination Proofs by Generalized Embedding.
RTA
Dieter Hofbauer
1990 — conf
Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation Lengths.
ALP
Dieter Hofbauer
1989 — book
Grundlagen des maschinellen Beweisens - eine Einführung für Informatiker und Mathematiker.
Dieter Hofbauer, Ralf-Detlef Kutsche
1989 — conf
Termination Proofs and the Length of Derivations (Preliminary Version).
RTA
Dieter Hofbauer, Clemens Lautemann
1988 — conf
Proving Inductive Theorems Based on Term Rewriting Systems.
ALP
Dieter Hofbauer, Ralf-Detlef Kutsche
1988 — conf
Proving Inductive Theorems in Equational Theories.
ADT
Dieter Hofbauer, Ralf-Detlef Kutsche