Johannes Waldmann

	2009
24		Johannes Waldmann: Automatic Termination. RTA 2009: 1-16
23		Jörg Endrullis, Roel C. de Vrijer, Johannes Waldmann: Local Termination. RTA 2009: 270-284
	2008
22		Georg Moser, Andreas Schnabl, Johannes Waldmann: Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations. FSTTCS 2008
21		Adam Koprowski, Johannes Waldmann: Arctic Termination ...Below Zero. RTA 2008: 202-216
20		Jörg Endrullis, Johannes Waldmann, Hans Zantema: Matrix Interpretations for Proving Termination of Term Rewriting. J. Autom. Reasoning 40(2-3): 195-220 (2008)
	2007
19		Hans Zantema, Johannes Waldmann: Termination by Quasi-periodic Interpretations. RTA 2007: 404-418
18		Alfons 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)
17		Johannes Waldmann: Weighted Automata for Proving Termination of String Rewriting. Journal of Automata, Languages and Combinatorics 12(4): 545-570 (2007)
	2006
16		Jörg Endrullis, Johannes Waldmann, Hans Zantema: Matrix Interpretations for Proving Termination of Term Rewriting. IJCAR 2006: 574-588
15		Dieter Hofbauer, Johannes Waldmann: Termination of String Rewriting with Matrix Interpretations. RTA 2006: 328-342
14		Dieter Hofbauer, Johannes Waldmann: Termination of {aa->bc, bb->ac, cc->ab}. Inf. Process. Lett. 98(4): 156-158 (2006)
	2005
13		Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema: On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems. RTA 2005: 353-367
12		Alfons 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)
11		Alfons Geser, Dieter Hofbauer, Johannes Waldmann: Termination Proofs for String Rewriting Systems via Inverse Match-Bounds. J. Autom. Reasoning 34(4): 365-385 (2005)
	2004
10		Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema: Finding Finite Automata That Certify Termination of String Rewriting. CIAA 2004: 134-145
9		Johannes Waldmann: Matchbox: A Tool for Match-Bounded String Rewriting. RTA 2004: 85-94
8		Alfons Geser, Dieter Hofbauer, Johannes Waldmann: Match-Bounded String Rewriting Systems. Appl. Algebra Eng. Commun. Comput. 15(3-4): 149-171 (2004)
7		Dieter Hofbauer, Johannes Waldmann: Deleting string rewriting systems preserve regularity. Theor. Comput. Sci. 327(3): 301-317 (2004)
	2003
6		Dieter Hofbauer, Johannes Waldmann: Deleting String Rewriting Systems Preserve Regularity. Developments in Language Theory 2003: 337-348
5		Alfons Geser, Dieter Hofbauer, Johannes Waldmann: Match-Bounded String Rewriting Systems. MFCS 2003: 449-459
	2002
4		Johannes Waldmann: Rewrite Games. RTA 2002: 144-158
	2001
3		Gundula Niemann, Johannes Waldmann: Some Regular Languages That Are Church-Rosser Congruential. Developments in Language Theory 2001: 330-339
	2000
2		Johannes Waldmann: The Combinator S. Inf. Comput. 159(1-2): 2-21 (2000)
	1998
1		Johannes Waldmann: Normalization of S-Terms is Decidable. RTA 1998: 138-150

Coauthor Index

1	Jörg Endrullis	[16] [20] [23]
2	Alfons Geser	[5] [8] [10] [11] [12] [13] [18]
3	Dieter Hofbauer	[5] [6] [7] [8] [10] [11] [12] [13] [14] [15] [18]
4	Adam Koprowski	[21]
5	Georg Moser	[22]
6	Gundula Niemann	[3]
7	Andreas Schnabl	[22]
8	Roel C. de Vrijer	[23]
9	Hans Zantema	[10] [12] [13] [16] [18] [19] [20]

Colors in the list of coauthors