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

DOI10.1007/978-3-642-00590-9_13zbMath1234.68244OpenAlexW1829276407MaRDI QIDQ3617699

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)

Related Items (1)

Path querying on acyclic graphs using Boolean grammars

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