The finiteness of synchronous, tabled picture languages is decidable

Bianca Truthe. The finiteness of synchronous, tabled picture languages is decidable. Theoretical Computer Science, 366(3):297-315, 2006. [doi]

Abstract

Abstract is missing.