Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Luca Aceto. Nested Semantics over Finite Trees are Equationally Hard: Invited Talk. Electronic Notes in Theoretical Computer Science, 96:5-6, 2004. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Nested semantics over finite trees are equationally hardLuca Aceto, Wan Fokkink, Rob J. van Glabbeek, Anna Ingólfsdóttir. iandc, 191(2):203-232, 2004. [doi]
The following publications are possibly variants of this publication: