Combining matching algorithms: The regular case†
Under an Elsevier user license
open archive
Cited by (0)
- †
This is a revised version of a paper presented at the Third International Conference on Rewriting Techniques and Applications (Chapel Hill, NC) and which appeared in Springer Lec. Notes Comp. Sci. 355. This research was carried out at the Laboratory for Computer Science at MIT with support from NYNEX, NSF grant CCR-8706652, and the Advanced Research Projects Agency of the DoD, monitored by the ONR under contract N00014-83-K-0125.
Copyright © 1991 Published by Elsevier Ltd.