Dieter Hofbauer - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 30 from 30

2019

Sparse Tiling Through Overlap Closures for Termination of String RewritingAlfons Geser, Dieter Hofbauer, Johannes Waldmann. RTA 2019: [doi]

2010

Finding and Certifying LoopsHarald Zankl, Christian Sternagel, Dieter Hofbauer, Aart Middeldorp. sofsem 2010: 755-766 [doi]

2007

On tree automata that certify termination of left-linear term rewriting systemsAlfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema. iandc, 205(4):512-534, 2007. [doi]

2006

Termination of String Rewriting with Matrix InterpretationsDieter Hofbauer, Johannes Waldmann. RTA 2006: 328-342 [doi]

Termination of {::::a::::::::a::::->::::b::::::::c::::, ::::b::::::::b::::->::::a::::::::c::::, ::::c::::::::c::::->::::a::::::::b::::}Dieter Hofbauer, Johannes Waldmann. ipl, 98(4):156-158, 2006. [doi]

2005

2004

Match-Bounded String Rewriting SystemsAlfons Geser, Dieter Hofbauer, Johannes Waldmann. aaecc, 15(3-4):149-171, 2004. [doi]

Finding Finite Automata That Certify Termination of String RewritingAlfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema. wia 2004: 134-145 [doi]

Deleting string rewriting systems preserve regularityDieter Hofbauer, Johannes Waldmann. TCS, 327(3):301-317, 2004. [doi]

2003

Match-Bounded String Rewriting SystemsAlfons Geser, Dieter Hofbauer, Johannes Waldmann. mfcs 2003: 449-459 [doi]

An upper bound on the derivational complexity of Knuth-Bendix orderingsDieter Hofbauer. iandc, 183(1):43-56, 2003. [doi]

Deleting String Rewriting Systems Preserve RegularityDieter Hofbauer, Johannes Waldmann. dlt 2003: 337-348 [doi]

2002

Test Sets for the Universal and Existential Closure of Regular Tree LanguagesDieter Hofbauer, Maria Huber. iandc, 178(2):465-498, 2002. [doi]

2001

Termination Proofs for Ground Rewrite Systems - Interpretations and Derivational ComplexityDieter Hofbauer. aaecc, 12(1/2):21-38, 2001. [doi]

Termination Proofs by Context-Dependent InterpretationsDieter Hofbauer. RTA 2001: 108-121 [doi]

1999

Test Sets for the Universal and Existential Closure of Regular Tree LanguagesDieter Hofbauer, Maria Huber. RTA 1999: 205-219 [doi]

1994

Linearizing Term Rewriting Systems Using Test SetsDieter Hofbauer, Maria Huber. JSC, 17(1):91-129, 1994.

Some Results on Top-Context-Free Tree LanguagesDieter Hofbauer, Maria Huber, Gregory Kucherov. caap 1994: 157-171

1992

Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation LengthsDieter Hofbauer. TCS, 105(1):129-140, 1992.

Computing Linearizations Using Test SetsDieter Hofbauer, Maria Huber. ctrs 1993: 287-301

Termination proofs and derivation lengths in term rewriting systemsDieter Hofbauer. PhD thesis, Technical University of Berlin, Germany, 1992. [doi]

1991

Time Bounded Rewrite Systems and Termination Proofs by Generalized EmbeddingDieter Hofbauer. RTA 1991: 62-73

1990

Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation LengthsDieter Hofbauer. icalp 1990: 347-358

1989

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

Grundlagen des maschinellen Beweisens - eine Einführung für Informatiker und MathematikerDieter Hofbauer, Ralf-Detlef Kutsche. Vieweg, 1989.

1988

Proving Inductive Theorems Based on Term Rewriting SystemsDieter Hofbauer, Ralf-Detlef Kutsche. icalp 1988: 180-190

Proving Inductive Theorems in Equational TheoriesDieter Hofbauer, Ralf-Detlef Kutsche. WADT 1988:

Sign in or sign up to see more results.

runs on WebDSL