[Books]    [Journals]    [Conferences]    [Software]    [Reports etc]

Publications

Books
Dieter Hofbauer and Ralf-Detlef Kutsche
Grundlagen des maschinellen Beweisens (in german)
Vieweg, 1989, second revised edition 1991
bibtex-Eintrag    weitere Informationen
Journal Papers and Book Chapters
Alfons Geser, Dieter Hofbauer, Johannes Waldmann and Hans Zantema
On tree automata that certify termination of left-linear term rewriting systems
Information and Computation 205(4):512-534, 2007
Dieter Hofbauer and Johannes Waldmann
Termination of {aa → bc, bb → ac, cc → ab}
Information Processing Letters, 98:156-158, 2006
preprint, 4 pages (ps.gz)
Alfons Geser, Dieter Hofbauer, Johannes Waldmann and Hans Zantema
Finding finite automata that certify termination of string rewriting systems
International Journal of Foundations of Computer Science 16(3):471-486, 2005
Alfons Geser, Dieter Hofbauer and Johannes Waldmann
Termination proofs for string rewriting systems via inverse match-bounds
Journal of Automated Reasoning, 34(4):365-385, 2005
report version, 15 pages (ps.gz)
Etsuro Moriya, Dieter Hofbauer, Maria Huber and Friedrich Otto
On state-alternating context-free grammars
Theoretical Computer Science 337:183-216, 2005
report version, 36 pages (pdf)
Alfons Geser, Dieter Hofbauer and Johannes Waldmann
Match bounded string rewriting systems
Applicable Algebra in Engineering, Communication and Computing 15(3-4):149-171, 2004
report version, 18 pages (pdf)
Dieter Hofbauer and Johannes Waldmann
Deleting string rewriting systems preserve regularity
Theoretical Computer Science 327(3):301-317, 2004
abstract    report version, 13 pages (ps.gz)
Dieter Hofbauer
An upper bound on the derivational complexity of Knuth-Bendix orderings
Information and Computation 183(1):43-56, 2003
abstract    bibtex entry    report version, 15 pages (ps.gz)
Dieter Hofbauer and Maria Huber
Test sets for the universal and existential closure of regular tree languages
Information and Computation 178(2):465-498, 2002
abstract    bibtex entry    revised report version, 42 pages (ps.gz)
Dieter Hofbauer
Termination proofs for ground rewrite systems - interpretations and derivational complexity
Applicable Algebra in Engineering, Communication and Computing 12(1-2):21-38, 2001
abstract    bibtex entry    report version, 18 pages (ps.gz)
Dieter Hofbauer, Maria Huber and Gregory Kucherov
How to get rid of projection rules in context-free tree grammars
Studies in Logic, Language and Information, The Tbilisi Symp. on Logic, Language and Computation: Selected Papers, Chapter 15, pp. 235-247. CSLI (Center for the Study of Language and Information, Stanford) and FoLLI (European Association for Logic, Language and Information), 1998
abstract    bibtex entry    report version, 10 pages (ps.gz)
Dieter Hofbauer and Maria Huber
Linearizing term rewriting systems using test sets
Journal of Symbolic Computation 17(1):91-129, 1994
abstract    bibtex entry
Dieter Hofbauer
Termination proofs by multiset path orderings imply primitive recursive derivation lengths
Theoretical Computer Science 105(1):129-140, 1992
abstract    bibtex entry
Conference Papers
Dieter Hofbauer and Johannes Waldmann
Proving termination with matrix interpretations
Proc. 17th Int. Conf. on Rewriting Techniques and Applications RTA-06, Seattle (USA),
Lecture Notes in Computer Science 4098, pp. 328-342, 2006   ©Springer-Verlag
Alfons Geser, Dieter Hofbauer, Johannes Waldmann and Hans Zantema
On tree automata that certify termination of left-linear term rewriting systems
Proc. 16th Int. Conf. on Rewriting Techniques and Applications RTA-05, Nara (Japan),
Lecture Notes in Computer Science 3467, pp. 353-367, 2005   ©Springer-Verlag
Alfons Geser, Dieter Hofbauer, Johannes Waldmann and Hans Zantema
Finding finite automata that certify termination of string rewriting
Proc. 9th Int. Conf. on Implementation and Application of Automata CIAA-04, Kingston (Canada),
Lecture Notes in Computer Science 3317, pp. 134-145, 2004   ©Springer-Verlag
Alfons Geser, Dieter Hofbauer and Johannes Waldmann
Match-bounded string rewriting systems
Proc. 28th Int. Symp. on Mathematical Foundations of Computer Science MFCS-03, Bratislava (Slovak Republic),
Lecture Notes in Computer Science 2747, pp. 449-459, 2003   ©Springer-Verlag
abstract    bibtex entry    paper, 10 pages (ps.gz)    report version, 18 pages (ps.gz)
Dieter Hofbauer and Johannes Waldmann
Deleting string rewriting systems preserve regularity
Proc. 7th Int. Conf. Developments in Language Theory DLT-03, Szeged (Hungary),
Lecture Notes in Computer Science 2710, pp. 337-348, 2003   ©Springer-Verlag
abstract    bibtex entry    report version, 13 pages (ps.gz)
Dieter Hofbauer, Christoph Kögl, Klaus E. Madlener and Friedrich Otto
XSSR: An experimental system for string rewriting - Decision problems, algorithms, and implementation
Proc. 1st Int. Congress of Mathematical Software ICMS-02, Beijing (China),
pp. 126-135, World Scientific, 2002
abstract    bibtex entry
Dieter Hofbauer
Termination proofs by context-dependent interpretations
Proc. 12th Int. Conf. on Rewriting Techniques and Applications RTA-01, Utrecht (The Netherlands),
Lecture Notes in Computer Science 2051, pp. 108-121, 2001   ©Springer-Verlag
abstract    bibtex entry    paper, 14 pages (ps.gz)
Dieter Hofbauer and Maria Huber
Test sets for the universal and existential closure of regular tree languages
Proc. 10th Int. Conf. on Rewriting Techniques and Applications RTA-99, Trento (Italy),
Lecture Notes in Computer Science 1631, pp. 205-219, 1999   ©Springer-Verlag
abstract    bibtex entry    journal version    revised report version, 42 pages (ps.gz)
Dieter Hofbauer, Maria Huber and Gregory Kucherov
How to get rid of projection rules in context-free tree grammars
Proc. Tbilisi Symp. on Logic, Language and Computation, Gudauri (Georgia),
University of Edinburgh, Human Communication Research Center, RP-72, 1995
abstract    bibtex entry    book chapter    report version, 10 pages (ps.gz)
Dieter Hofbauer, Maria Huber and Gregory Kucherov
Some results on top-context-free tree languages
Proc. 19th Int. Coll. on Trees in Algebra and Programming CAAP-94, Edinburgh (U.K.),
Lecture Notes in Computer Science 787, pp. 157-171, 1994
abstract    bibtex entry    report version (ps.gz)
Dieter Hofbauer and Maria Huber
Computing linearizations using test sets
Proc. 3rd Int. Workshop on Conditional Term Rewriting Systems CTRS-92, Pont-à-Mousson (France),
Lecture Notes in Computer Science 656, pp. 287-301, 1993
abstract    bibtex entry    journal version
Dieter Hofbauer
Time bounded rewrite systems and termination proofs by generalized embedding
Proc. th Int. Conf. on Rewriting Techniques and Applications RTA-91, Como (Italy),
Lecture Notes in Computer Science 488, pp. 62-73, 1991
abstract    bibtex entry
Dieter Hofbauer
Termination proofs by multiset path orderings imply primitive recursive derivation lengths
Proc. 2nd Int. Conf. on Algebraic and Logic Programming ALP-90, Nancy (France),
Lecture Notes in Computer Science 463, pp. 347-358, 1990
abstract    bibtex entry    journal version
Dieter Hofbauer and Clemens Lautemann
Termination proofs and the length of derivations
Proc. 3rd Int. Conf. on Rewriting Techniques and Applications RTA-89, Chapel Hill (USA),
Lecture Notes in Computer Science 355, pp. 167-177, 1989
abstract    bibtex entry    revised version, 12 pages (ps.gz)
Dieter Hofbauer and Ralf-Detlef Kutsche
Proving inductive theorems based on term rewriting systems
Proc. Int. Workshop on Algebraic and Logic Programming ALP-88, Gaussig (GDR),
Lecture Notes in Computer Science 343, pp. 180-190, 1988
abstract    bibtex entry
Software
XSSR: An eXperimental System for String Rewriting
Joint project of the research groups Prof. F. Otto, Univ. Kassel, and Prof. K. Madlener, Univ. Kaiserslautern. Supported (1998-2001) as part of the DFG project Convergent reduction systems for monoids and groups: Algebraic characterizations and completion procedures.
Reports, Theses, etc
Dieter Hofbauer and Johannes Waldmann
Termination of {aa → bc, bb → ac, cc → ab}
preprint (ps.gz), 4 pages, 2005
Alfons Geser, Dieter Hofbauer and Johannes Waldmann
Deciding termination for ancestor match-bounded string rewriting systems
Technical Report 2005-XX, National Institute of Aerospace, Hampton, VA (USA), 14 pages, 2005
Alfons Geser, Dieter Hofbauer and Johannes Waldmann
Tree automata that certify termination of term rewriting systems
Proc. 7th Int. Workshop on Termination WST-04, Aachen (Germany),
Aachener Informatik Berichte AIB-2004-07, RWTH Aachen, Department of Computer Science, pp. 14-17, 2004
Alfons Geser, Dieter Hofbauer and Johannes Waldmann
Termination proofs for string rewriting systems via inverse match-bounds
Technical Report 2004-02, National Institute of Aerospace, Hampton, VA (USA), 15 pages, 2004
Etsuro Moriya, Dieter Hofbauer, Maria Huber and Friedrich Otto
On state-alternating context-free grammars
Technical Report 2003-5, Advanced Research Institute for Science and Engineering, Waseda University, Tokyo (Japan), 36 pages, 2003
Alfons Geser, Dieter Hofbauer and Johannes Waldmann
Match-bounded string rewriting systems
Technical Report 2003-09, National Institute of Aerospace, Hampton, VA (USA), 18 pages, 2003
Alfons Geser, Dieter Hofbauer and Johannes Waldmann
Match-bounded string rewriting systems and automated termination proofs
Proc. 6th Int. Workshop on Termination WST-03, Valencia (Spain),
Technical Report DSIC-II/15/03, Universidad Politécnica de Valencia, pp. 19-22, 2003
Dieter Hofbauer
On termination of multiple premise ground rewrite systems
Extended Abstracts 5th International Workshop on Termination WST-01,
Department of Philosophy, Utrecht University, Logic Group Preprint Series No. 209, p. 22, 2001.
abstract (ps.gz)
Dieter Hofbauer, Christoph Kögl, Klaus Madlener, Friedrich Otto, Birgit Reinert
XSSR: An experimental system for string-rewriting - Decision problems, algorithms, and implementation
Proc. Federated Logic Conference (FLoC) Workshop on Gröbner Bases and Rewriting Techniques, Trento (Italy), 1999
bibtex entry    paper, 5 pages (ps.gz)
Dieter Hofbauer
Termination proofs and derivation lengths in term rewriting systems
Dissertation, Technische Universität Berlin, 1991
Report version: Forschungsberichte des Fachbereichs Informatik 92-46, Technische Universität Berlin, 1992
bibtex entry
Dirk Siefkes, Dieter Hofbauer and Ralf Kutsche
Completeness proofs for logic programming: Refutations and derivations for ground clauses
Forschungsberichte des Fachbereichs Informatik 88-23, Technische Universität Berlin, 38 pages, 1988
abstract    bibtex entry
Dieter Hofbauer
Auswertungsstrategien für die funktionale Sprache REC
(Evaluation strategies for the functional language REC, in german)
Diplomarbeit, Technische Universität Berlin, 1985
bibtex entry

Last modified: Fri Aug 24 15:01:56 CEST 2007