"An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees."

Hao Yuan, Patrick Th. Eugster (2009)

> Home

Details and statistics

DOI: 10.1007/978-3-642-00590-9_13

access: open

type: Conference or Workshop Paper

metadata version: 2018-06-26

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/esop/YuanE09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/esop/YuanE09
Hao Yuan, Patrick Th. Eugster:
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees. ESOP 2009: 175-189

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.