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

DOI10.1007/978-3-642-00590-9_13MaRDI QIDQ3617699zbMATH OpenOpenAlexFDO

Authors Hao Yuan, Patrick Eugster

Publication date 31 March 2009

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-00590-9_13

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Recommendations

• Dynamic complexity of the Dyck reachability
• scientific article; zbMATH DE number 177455
• Context-free recognition via shortest paths computation: a version of Valiant's algorithm
• scientific article; zbMATH DE number 3978426
• Context-sensitive data-dependence analysis via linear conjunctive language reachability

Cited in

(2)

• Path querying on acyclic graphs using Boolean grammars
• Context-sensitive data-dependence analysis via linear conjunctive language reachability

This page was built for publication: An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3617699)