Ko, Sang-Ki
Han, Yo-Sub
Salomaa, Kai
Funding for this research was provided by:
MEST (2015R1D1A1A01060097)
NRF (2014K2A1A2048512)
Natural Sciences and Engineering Research Council of Canada (OGP0147224)
This article is maintained by: Elsevier
Article Title: Approximate matching between a context-free grammar and a finite-state automaton
Journal Title: Information and Computation
CrossRef DOI link to publisher maintained version: https://doi.org/10.1016/j.ic.2016.02.001
Content Type: article
Copyright: Copyright © 2016 Elsevier Inc. All rights reserved.