### 5 papers:

- DLT-2015-BealH #finite
- Deciding Proper Conjugacy of Classes of One-Sided Finite-Type-Dyck Shifts (MPB, PH), pp. 167–178.
- PLDI-2013-ZhangLYS #algorithm #alias #analysis #performance
- Fast algorithms for Dyck-CFL-reachability with applications to alias analysis (QZ, MRL, HY, ZS), pp. 435–446.
- CIAA-2013-IbarraR #problem
- Some Decision Problems Concerning NPDAs, Palindromes, and Dyck Languages (OHI, BR), pp. 193–207.
- ESOP-2009-YuanE #algorithm #performance #problem #reachability
- An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees (HY, PTE), pp. 175–189.
- STOC-1970-Nivat #on the #product line
- On Some Families of Languages Related to the Dyck Language (MN), pp. 221–225.