Login / Signup

The finiteness of synchronous, tabled picture languages is decidable.

Bianca Truthe
Published in: Theor. Comput. Sci. (2006)
Keyphrases