FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING...

International Journal of Foundations of Computer Science 2005 / 06 Vol. 16; Iss. 3

FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS

GESER, ALFONS, HOFBAUER, DIETER, WALDMANN, JOHANNES, ZANTEMA, HANS
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:
16
Language:
english
Journal:
International Journal of Foundations of Computer Science
DOI:
10.1142/S0129054105003108
Date:
June, 2005
File:
PDF, 945 KB
english, 2005
Conversion to is in progress
Conversion to is failed