Johannes Waldmann - Publications
for more recent publications, see my
DBLP entry
Journal papers
- The Combinator S,
Information and Computation 159, 2-21 (2000)
Conference papers
-
Johannes Waldmann:
Polynomially Bounded Matrix Interpretations,
to appear in: RTA 2010
(pdf)
-
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema:
Tree automata that certify termination
of left-linear term rewriting systems,
RTA 2005
full version
-
Alfons Geser, Dieter Hofbauer, Johannes Waldmann:
Match-Bounded String Rewriting Systems,
28th International Symposium on
Mathematical Foundations of Computer Science,
August 25 - 29, 2003, Bratislava, Slovak Republic
-
Dieter Hofbauer, Johannes Waldmann:
Deleting String Rewrite Systems Preserve Regularity,
Developments in Language Theory,
Seventh International Conference,
July 7-11, 2003, Szeged, Hungary
-
Johannes Waldmann:
On Rewrite Games
in: Rewriting Techniques and Applications, 13th International Conference, RTA 2002,
Copenhagen, Denmark, July 22-24, 2002, Proceedings. Lecture Notes in Computer Science 2378
-
Gundula Niemann, Johannes Waldmann:
Some Regular Languages that are Church-Rosser Congruential,
in: 5th Intl. Conf. Developments in Language Theory (DLT), Vienna 2001
-
Johannes Waldmann:
Normalization of S-Terms is Decidable,
in: 9th Conf. Rewriting Techniques and Applications (RTA), Tsukuba 1998,
ed. T. Nipkow, LNCS 1379, pp 138-150
Workshop papers
-
Alfons Geser, Dieter Hofbauer, Johannes Waldmann:
Match-Bounded String Rewriting Systems
and Automated Termination Proofs
6th International Workshop on Termination,
Valencia, Spain, June 13-14, 2003
-
Mirko Rahn, Johannes Waldmann:
The Leipzig autotool System for Grading Student Homework
in: Functional and Declarative Programming in Education (FDPE 2002),
M. Hanus, S. Krishnamurthi, S. Thompson (Eds.)
(PostScript)
-
Mirko Rahn, Alf Richter, Johannes Waldmann:
The Leipzig autotool System for Grading Student Homework
in: Workshop on e-Learning, Hochschule für Technik, Wirtschaft und Kultur
Leipzig (FH), 26.-27. 9. 2002, Leipzig, Germany
-
Mirko Rahn, Alf Richter, Johannes Waldmann:
The Leipzig autotool System for Grading Student Homework
in: 12. Theorietag Automaten und Formale Sprachen,
Universität Halle-Wittenberg, 23.-26. 9. 2002, Wittenberg
-
Mario Schmidt, Heiko Stamer, Johannes Waldmann:
Busy Beaver PCPs,
(5th International Workshop on Termination, Utrecht, 21. 5. 2001)
(Abstract)
-
Johannes Waldmann:
Fixpunkte von Morphismen
und Normalformen von Ersetzungssystemen
(10. Theorietag der Fachgruppe 0.1.5 Automaten und Formale Sprachen der GI,
Technische Universität Wien, 27. 9. 2000)
(Ausgedehnte Zusammenfassung)
-
Johannes Waldmann:
Boolesche Operationen auf Wort- und Baumautomaten mit kurzen Schleifen
(9. Theorietag der Fachgruppe 0.1.5 der Gesellschaft für Informatik,
Schauenburg-Elmshagen, 28. 9. 1999)
(Text)
-
Johannes Waldmann:
Tree Automata in RX (software demo)
(Workshop on Implementing Automata, Potsdam,
17. 7. 1999)
(extended abstract)
-
Johannes Waldmann:
Deciding Head Normalization and Proving Top Termination for CL(S)
(4th Intl. Workshop on Termination, Schloß Dagstuhl,
12. 5. 1999)
PhD Dissertation
The Combinator S,
accepted by the Fakultät für Mathematik und Informatik
of the Friedrich-Schiller-Universität Jena, 1998.
Referees: Hans-Dietrich Hecker, Jena; Jan Willem Klop, Amsterdam;
Horst Reichel, Dresden.
Technical Reports and Notes
-
Dieter Hofbauer and Johannes Waldmann:
Termination of { aa -> cb, bb -> ca, cc -> ba }
(note)
-
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema:
Tree automata that certify termination
of left-linear term rewriting systems,
(full version).
- Johannes Waldmann: Nimm zwei,
IR-432:
(abstract
| ps.Z)
(Vrije Universiteit Amsterdam)
- Johannes Waldmann: How To Decide The S,
FE-97-03:
(abstract
| dvi.gz
| ps.gz) (Universität Jena)
- Addendum to FE-97-03:
(abstract
| dvi.gz
| ps.gz) (Universität Jena)
- Johannes Waldmann:
Infinite Unique Head Reduction Chains in CL(S),
FE-96-27:
(abstract
| dvi.gz
| ps.gz) (Universität Jena)
http://www.imn.htwk-leipzig.de/~waldmann/