Termination and derivational complexity of confluent...

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

Termination and derivational complexity of confluent one-rule string-rewriting systems

Yuji Kobayashi, Masashi Katsura, Kayoko Shikishima-Tsuji
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:
262
Year:
2001
Language:
english
Pages:
50
DOI:
10.1016/s0304-3975(00)00367-4
File:
PDF, 361 KB
english, 2001
Conversion to is in progress
Conversion to is failed