Nested Semantics over Finite Trees are Equationally Hard: Invited Talk

Luca Aceto. Nested Semantics over Finite Trees are Equationally Hard: Invited Talk. Electronic Notes in Theoretical Computer Science, 96:5-6, 2004. [doi]

Abstract

Abstract is missing.