L(A)=L(B)? decidability results from complete formal systems

GĂ©raud SĂ©nizergues. L(A)=L(B)? decidability results from complete formal systems. Theoretical Computer Science, 251(1-2):1-166, 2001. [doi]

Abstract

Abstract is missing.