BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × France
1 × Germany
1 × Hungary
1 × Japan
1 × The Netherlands
2 × Italy
2 × USA
Collaborated with:
J.Waldmann ∅ A.Geser H.Zantema M.Huber C.Lautemann R.Kutsche
Talks about:
termin (8) rewrit (7) system (5) string (4) proof (4) automata (3) certifi (3) that (3) interpret (2) regular (2)

Person: Dieter Hofbauer

DBLP DBLP: Hofbauer:Dieter

Contributed to:

RTA 20062006
RTA 20052005
CIAA 20042004
CIAA 20042005
DLT 20032003
RTA 20012001
RTA 19991999
RTA 19911991
ALP 19901990
RTA 19891989
ALP 19881988

Wrote 11 papers:

RTA-2006-HofbauerW #matrix #string #termination
Termination of String Rewriting with Matrix Interpretations (DH, JW), pp. 328–342.
RTA-2005-GeserHWZ #automaton #linear #on the #term rewriting #termination
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems (AG, DH, JW, HZ), pp. 353–367.
CIAA-2004-GeserHWZ #automaton #finite #string #termination
Finding Finite Automata That Certify Termination of String Rewriting (AG, DH, JW, HZ), pp. 134–145.
CIAA-J-2004-GeserHWZ05 #automaton #finite #string #term rewriting #termination
Finding finite automata that certify termination of string rewriting systems (AG, DH, JW, HZ), pp. 471–486.
DLT-2003-HofbauerW #string #term rewriting
Deleting String Rewriting Systems Preserve Regularity (DH, JW), pp. 337–348.
RTA-2001-Hofbauer #proving #termination
Termination Proofs by Context-Dependent Interpretations (DH), pp. 108–121.
RTA-1999-HofbauerH #testing
Test Sets for the Universal and Existential Closure of Regular Tree Languages (DH, MH), pp. 205–219.
RTA-1991-Hofbauer #bound #proving #term rewriting #termination
Time Bounded Rewrite Systems and Termination Proofs by Generalized Embedding (DH), pp. 62–73.
ALP-1990-Hofbauer #multi #order #proving #recursion #termination
Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation Lengths (DH), pp. 347–358.
RTA-1989-HofbauerL #proving #termination
Termination Proofs and the Length of Derivations (DH, CL), pp. 167–177.
ALP-1988-HofbauerK #induction #proving #term rewriting #theorem
Proving Inductive Theorems Based on Term Rewriting Systems (DH, RDK), pp. 180–190.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.