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

Author: Kobayashi Y.   Katsura M.   Shikishima-Tsuji K.  

Publisher: Elsevier

ISSN: 0304-3975

Source: Theoretical Computer Science, Vol.262, Iss.1, 2001-07, pp. : 583-632

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract