Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Geser, Alfons"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On tree automata that certify termination of left-linear term rewriting systems
Alfons Geser
,
Dieter Hofbauer
,
Johannes Waldmann
,
Hans Zantema
Information and Computation
205
(4), 2007, pp. 512-534
Finding finite automata that certify termination of string rewriting systems
Alfons Geser
,
Dieter Hofbauer
,
Johannes Waldmann
,
Hans Zantema
International Journal of Foundations of Computer Science
16
(3), 2005, pp. 471-486
Match-bounded string rewriting systems
Alfons Geser
,
Dieter Hofbauer
,
Johannes Waldmann
Lecture Notes in Computer Science
2747
, 2003, pp. 449-459
Relative undecidability in term rewriting: I. The termination hierarchy
Alfons Geser
,
Aart Middeldorp
,
Enno Ohlebusch
,
Hans Zantema
Information and Computation
178
(1), 2002, pp. 101-131
Relative undecidability in term rewriting: II. The confluence hierarchy
Alfons Geser
,
Aart Middeldorp
,
Enno Ohlebusch
,
Hans Zantema
Information and Computation
178
(1), 2002, pp. 132-148
Decidability of termination of grid string rewriting rules
Alfons Geser
SIAM Journal on Computing
31
(4), 2002, pp. 1156-1168
On normalizing, non-terminating one-rule string rewriting systems
Alfons Geser
Theoretical Computer Science
243
(1-2), 2000, pp. 489-498
Omega-termination is undecidable for totally terminating term rewriting systems
Alfons Geser
Journal Symbolic Computation
23
(4), 1997, pp. 399-411