Document Type

Technical Report

Publication Date

Fall 9-1-1977

Abstract

This paper continues the research (started in [3]) on elementary DOL systems. In particular we provide an alternative (and simpler than the one presented in [1]) proof that the DOL sequence equivalence problem is decidable.

Share

COinS