dblp.uni-trier.dewww.uni-trier.de

Dieter Hofbauer Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2007
26EEAlfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema: On tree automata that certify termination of left-linear term rewriting systems. Inf. Comput. 205(4): 512-534 (2007)
2006
25EEDieter Hofbauer, Johannes Waldmann: Termination of String Rewriting with Matrix Interpretations. RTA 2006: 328-342
24EEDieter Hofbauer, Johannes Waldmann: Termination of {aa->bc, bb->ac, cc->ab}. Inf. Process. Lett. 98(4): 156-158 (2006)
2005
23EEAlfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema: On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems. RTA 2005: 353-367
22EEAlfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema: Finding finite automata that certify termination of string rewriting systems. Int. J. Found. Comput. Sci. 16(3): 471-486 (2005)
21EEAlfons Geser, Dieter Hofbauer, Johannes Waldmann: Termination Proofs for String Rewriting Systems via Inverse Match-Bounds. J. Autom. Reasoning 34(4): 365-385 (2005)
20EEEtsuro Moriya, Dieter Hofbauer, Maria Huber, Friedrich Otto: On state-alternating context-free grammars. Theor. Comput. Sci. 337(1-3): 183-216 (2005)
2004
19EEAlfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema: Finding Finite Automata That Certify Termination of String Rewriting. CIAA 2004: 134-145
18EEAlfons Geser, Dieter Hofbauer, Johannes Waldmann: Match-Bounded String Rewriting Systems. Appl. Algebra Eng. Commun. Comput. 15(3-4): 149-171 (2004)
17EEDieter Hofbauer, Johannes Waldmann: Deleting string rewriting systems preserve regularity. Theor. Comput. Sci. 327(3): 301-317 (2004)
2003
16EEDieter Hofbauer, Johannes Waldmann: Deleting String Rewriting Systems Preserve Regularity. Developments in Language Theory 2003: 337-348
15EEAlfons Geser, Dieter Hofbauer, Johannes Waldmann: Match-Bounded String Rewriting Systems. MFCS 2003: 449-459
14EEDieter Hofbauer: An upper bound on the derivational complexity of Knuth-Bendix orderings. Inf. Comput. 183(1): 43-56 (2003)
2002
13EEDieter Hofbauer, Maria Huber: Test Sets for the Universal and Existential Closure of Regular Tree Languages. Inf. Comput. 178(2): 465-498 (2002)
2001
12EEDieter Hofbauer: Termination Proofs by Context-Dependent Interpretations. RTA 2001: 108-121
11EEDieter Hofbauer: Termination Proofs for Ground Rewrite Systems - Interpretations and Derivational Complexity. Appl. Algebra Eng. Commun. Comput. 12(1/2): 21-38 (2001)
1999
10EEDieter Hofbauer, Maria Huber: Test Sets for the Universal and Existential Closure of Regular Tree Languages. RTA 1999: 205-219
1994
9EEDieter Hofbauer, Maria Huber, Gregory Kucherov: Some Results on Top-Context-Free Tree Languages. CAAP 1994: 157-171
8 Dieter Hofbauer, Maria Huber: Linearizing Term Rewriting Systems Using Test Sets. J. Symb. Comput. 17(1): 91-129 (1994)
1992
7 Dieter Hofbauer, Maria Huber: Computing Linearizations Using Test Sets. CTRS 1992: 287-301
6 Dieter Hofbauer: Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation Lengths. Theor. Comput. Sci. 105(1): 129-140 (1992)
1991
5EEDieter Hofbauer: Time Bounded Rewrite Systems and Termination Proofs by Generalized Embedding. RTA 1991: 62-73
1990
4EEDieter Hofbauer: Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation Lengths. ALP 1990: 347-358
1989
3EEDieter Hofbauer, Clemens Lautemann: Termination Proofs and the Length of Derivations (Preliminary Version). RTA 1989: 167-177
1988
2 Dieter Hofbauer, Ralf-Detlef Kutsche: Proving Inductive Theorems in Equational Theories. ADT 1988
1EEDieter Hofbauer, Ralf-Detlef Kutsche: Proving Inductive Theorems Based on Term Rewriting Systems. ALP 1988: 180-190

Coauthor Index

1Alfons Geser [15] [18] [19] [21] [22] [23] [26]
2Maria Huber [7] [8] [9] [10] [13] [20]
3Gregory Kucherov [9]
4Ralf-Detlef Kutsche [1] [2]
5Clemens Lautemann [3]
6Etsuro Moriya [20]
7Friedrich Otto [20]
8Johannes Waldmann [15] [16] [17] [18] [19] [21] [22] [23] [24] [25] [26]
9Hans Zantema [19] [22] [23] [26]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)