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
Last update Tue May 21 15:36:51 2013 CET by the
DBLP Team
—
Data released under the
ODC-BY 1.0 license
— See also our
legal information page
Data released under the ODC-BY 1.0 license — See also our legal information page
