Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Johannes Waldmann
2010 – today
- 2013
[i1]Alexander Bau, Johannes Waldmann: Propositional Encoding of Constraints over Tree-Shaped Data. CoRR abs/1305.4957 (2013)- 2011
- [c17]Aart Middeldorp, Georg Moser, Friedrich Neurauter, Johannes Waldmann, Harald Zankl: Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems. CAI 2011: 1-20
- 2010
- [j12]Jörg Endrullis, Roel C. de Vrijer, Johannes Waldmann: Local Termination: theory and practice. Logical Methods in Computer Science 6(3) (2010)
- [c16]
2000 – 2009
- 2009
- [j11]Andreas Gebhardt, Johannes Waldmann: Weighted Automata Define a Hierarchy of Terminating String Rewriting Systems. Acta Cybern. 19(2): 295-312 (2009)
- [j10]Adam Koprowski, Johannes Waldmann: Max/Plus Tree Automata for Termination of Term Rewriting. Acta Cybern. 19(2): 357-392 (2009)
- [c15]
- [c14]
- 2008
- [j9]Jörg Endrullis, Johannes Waldmann, Hans Zantema: Matrix Interpretations for Proving Termination of Term Rewriting. J. Autom. Reasoning 40(2-3): 195-220 (2008)
- [c13]Georg Moser, Andreas Schnabl, Johannes Waldmann: Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations. FSTTCS 2008: 304-315
- [c12]
- 2007
- [j8]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)
- [j7]Johannes Waldmann: Weighted Automata for Proving Termination of String Rewriting. Journal of Automata, Languages and Combinatorics 12(4): 545-570 (2007)
- [c11]
- 2006
- [j6]Dieter Hofbauer, Johannes Waldmann: Termination of {aa->bc, bb->ac, cc->ab}. Inf. Process. Lett. 98(4): 156-158 (2006)
- [c10]Jörg Endrullis, Johannes Waldmann, Hans Zantema: Matrix Interpretations for Proving Termination of Term Rewriting. IJCAR 2006: 574-588
- [c9]Dieter Hofbauer, Johannes Waldmann: Termination of String Rewriting with Matrix Interpretations. RTA 2006: 328-342
- 2005
- [j5]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)
- [j4]Alfons Geser, Dieter Hofbauer, Johannes Waldmann: Termination Proofs for String Rewriting Systems via Inverse Match-Bounds. J. Autom. Reasoning 34(4): 365-385 (2005)
- [c8]Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema: On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems. RTA 2005: 353-367
- 2004
- [j3]Alfons Geser, Dieter Hofbauer, Johannes Waldmann: Match-Bounded String Rewriting Systems. Appl. Algebra Eng. Commun. Comput. 15(3-4): 149-171 (2004)
- [j2]Dieter Hofbauer, Johannes Waldmann: Deleting string rewriting systems preserve regularity. Theor. Comput. Sci. 327(3): 301-317 (2004)
- [c7]
- [c6]Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema: Finding Finite Automata That Certify Termination of String Rewriting. CIAA 2004: 134-145
- 2003
- [c5]Dieter Hofbauer, Johannes Waldmann: Deleting String Rewriting Systems Preserve Regularity. Developments in Language Theory 2003: 337-348
- [c4]Alfons Geser, Dieter Hofbauer, Johannes Waldmann: Match-Bounded String Rewriting Systems. MFCS 2003: 449-459
- 2002
- [c3]
- 2001
- [c2]Gundula Niemann, Johannes Waldmann: Some Regular Languages That Are Church-Rosser Congruential. Developments in Language Theory 2001: 330-339
- 2000
- [j1]
1990 – 1999
- 1998
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-03 20:11 CEST by the dblp team