"Nested Semantics over Finite Trees are Equationally Hard: Invited Talk."

Luca Aceto (2003)

> Home

Details and statistics

DOI: 10.1016/J.ENTCS.2004.04.027

access: open

type: Conference or Workshop Paper

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/entcs/Aceto04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/entcs/Aceto04
Luca Aceto:
Nested Semantics over Finite Trees are Equationally Hard: Invited Talk. EXPRESS 2003: 5-6

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.