Interconvertibility of a class of set constraints and context-free-language reachability.

David Melski Thomas W. Reps Interconvertibility of a class of set constraints and context-free-language reachability. 29-98 2000 248 Theor. Comput. Sci. 1-2 db/journals/tcs/tcs248.html#MelskiR00 http://dx.doi.org/10.1016/S0304-3975(00)00049-9