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

Theoretical Computer Science 2001 Vol. 251; Iss. 1-2

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

Géraud Sénizergues
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
251
Year:
2001
Language:
english
Pages:
166
DOI:
10.1016/s0304-3975(00)00285-1
File:
PDF, 1.22 MB
english, 2001
Conversion to is in progress
Conversion to is failed