An ::::n:::::::2:::-bound for the ultimate equivalence problem of certain D0L systems over an ::::n::::-letter alphabet

Juha Honkala. An ::::n:::::::2:::-bound for the ultimate equivalence problem of certain D0L systems over an ::::n::::-letter alphabet. J. Comput. Syst. Sci., 71(4):506-519, 2005. [doi]

Abstract

Abstract is missing.