- j]. Abouelhoda,
Kurtz &
Ohlebusch 2004. I, Kärkkäinen &
Kempa 2014.
Gawrychowski &
Kociumaka 2017. Abouelhoda,
Kurtz &
Ohlebusch 2002.
Kurtz 1999. Puglisi...
-
Rewriting and All That.
Cambridge University Press. ISBN 9780521779203.
Ohlebusch, Enno (1998). "Church-Rosser
theorems for
abstract reduction modulo an...
-
values appear in text
order rather than
lexicographical order. Gog &
Ohlebusch (2011)
provide two
algorithms that
although being theoretically slow (...
- by a term
rewriting system with a
reduction ordering on its
arguments (
Ohlebusch, 2002, pp. 67).
Despite the
above examples of
programming languages which...
-
dependency pairs."
Theoretical Computer Science 236.1 (2000): 133-178.
Ohlebusch, Enno.
Advanced topics in term rewriting. Springer, 2002. Hans Zantema...
- Int. Conf., RTA-95 (postscript). LNCS. Vol. 914. Springer. pp. 426–431.
Ohlebusch, E.; Claves, C.; Marché, C. (2000). "TALP: A Tool for the Termination...
