The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Johannes Waldmann: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jörg Endrullis, Johannes Waldmann, Hans Zantema
    Matrix Interpretations for Proving Termination of Term Rewriting. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:574-588 [Conf]
  2. Dieter Hofbauer, Johannes Waldmann
    Deleting String Rewriting Systems Preserve Regularity. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2003, pp:337-348 [Conf]
  3. Gundula Niemann, Johannes Waldmann
    Some Regular Languages That Are Church-Rosser Congruential. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2001, pp:330-339 [Conf]
  4. Alfons Geser, Dieter Hofbauer, Johannes Waldmann
    Match-Bounded String Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:449-459 [Conf]
  5. Dieter Hofbauer, Johannes Waldmann
    Termination of String Rewriting with Matrix Interpretations. [Citation Graph (0, 0)][DBLP]
    RTA, 2006, pp:328-342 [Conf]
  6. 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]
  7. Johannes Waldmann
    Rewrite Games. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:144-158 [Conf]
  8. Johannes Waldmann
    Matchbox: A Tool for Match-Bounded String Rewriting. [Citation Graph (0, 0)][DBLP]
    RTA, 2004, pp:85-94 [Conf]
  9. Johannes Waldmann
    Normalization of S-Terms is Decidable. [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:138-150 [Conf]
  10. 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]
  11. 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]
  12. Johannes Waldmann
    The Combinator S. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2000, v:159, n:1-2, pp:2-21 [Journal]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. Hans Zantema, Johannes Waldmann
    Termination by Quasi-periodic Interpretations. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:404-418 [Conf]
  18. 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]

  19. Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations. [Citation Graph (, )][DBLP]


  20. Arctic Termination ...Below Zero. [Citation Graph (, )][DBLP]


  21. Local Termination. [Citation Graph (, )][DBLP]


  22. Automatic Termination. [Citation Graph (, )][DBLP]


  23. Polynomially Bounded Matrix Interpretations. [Citation Graph (, )][DBLP]


  24. Weighted Automata Define a Hierarchy of Terminating String Rewriting Systems. [Citation Graph (, )][DBLP]


  25. Max/Plus Tree Automata for Termination of Term Rewriting. [Citation Graph (, )][DBLP]


  26. Local Termination: theory and practice [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002