Termination and derivational complexity of confluent one-rule string-rewriting systems
暂无分享,去创建一个
Masashi Katsura | Yuji Kobayashi | Kayoko Shikishima-Tsuji | Kayoko Shikishima-Tsuji | Yuji Kobayashi | M. Katsura
[1] Celia Wrathall. Confluence of One-Rule Thue Systems , 1990, IWWERT.
[2] Yuri V. Matiyasevich,et al. Decision problems for semi-Thue systems with a few rules , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.
[3] E. Tahhan Bittar. Complexité linéaire du problème de Zantema , 1996 .
[4] Gérard Huet,et al. On the Uniform Halting Problem for Term Rewriting Systems , 1978 .
[5] Masashi Katsura,et al. On Termination of Confluent One-Rule String-Rewriting Systems , 1997, Inf. Process. Lett..