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