"Higher-Order Pushdown Trees Are Easy."

Teodor Knapik, Damian Niwinski, Pawel Urzyczyn (2002)

> Home

Details and statistics

DOI: 10.1007/3-540-45931-6_15

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/fossacs/KnapikNU02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fossacs/KnapikNU02
Teodor Knapik, Damian Niwinski, Pawel Urzyczyn:
Higher-Order Pushdown Trees Are Easy. FoSSaCS 2002: 205-222

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.