"A simple proof of sufficient conditions for the termination of the ..."

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

Enno Ohlebusch (1993)

> Home

Details and statistics

DOI: —

access: unavailable

type: Journal Article

metadata version: 2020-06-18

- no documents available
- export record
  dblp key:
  - journals/eatcs/Ohlebusch93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eatcs/Ohlebusch93
Enno Ohlebusch:
A simple proof of sufficient conditions for the termination of the disjoint union of term rewriting systems. Bull. EATCS 50: 223-228 (1993)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.