An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
In: Programming Languages and Systems ; Lecture Notes in Computer Science ; page 175-189 ; ISSN 0302-9743 1611-3349 ; ISBN 9783642005893 9783642005909; (2009)
Buch
Zugriff:
Titel: |
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
|
---|---|
Autor/in / Beteiligte Person: | Yuan, Hao ; Eugster, Patrick |
Link: | |
Quelle: | Programming Languages and Systems ; Lecture Notes in Computer Science ; page 175-189 ; ISSN 0302-9743 1611-3349 ; ISBN 9783642005893 9783642005909; (2009) |
Veröffentlichung: | Springer Berlin Heidelberg, 2009 |
Medientyp: | Buch |
ISBN: | 978-3-642-00589-3 (print) ; 978-3-642-00590-9 (print) ; 3-642-00589-6 (print) ; 3-642-00590-X (print) |
DOI: | 10.1007/978-3-642-00590-9_13 |
Sonstiges: |
|