Approximate Matching between a Context-Free Grammar and a Finite-State Automaton

Yo-Sub Han, Sang-Ki Ko, Kai Salomaa. Approximate Matching between a Context-Free Grammar and a Finite-State Automaton. In Stavros Konstantinidis, editor, Implementation and Application of Automata - 18th International Conference, CIAA 2013, Halifax, NS, Canada, July 16-19, 2013. Proceedings. Volume 7982 of Lecture Notes in Computer Science, pages 146-157, Springer, 2013. [doi]

Abstract

Abstract is missing.