Theoretical Computer Science, Volume 251

Volume 251, Number 1-2, 28 January 2001

• Géraud Sénizergues:
  L(A)=L(B)? decidability results from complete formal systems. 1-166
  Electronic Edition (link) BibTeX