Approximate matching between a context-free grammar and a finite-state automaton

DOI10.1016/j.ic.2016.02.001zbMath1336.68317MaRDI QIDQ259082

Yo-Sub Han, Sang-Ki Ko, Kai Salomaa

Publication date: 10 March 2016

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2016.02.001

zbMATH Keywords

context-free grammars; finite-state automata; approximate matching; edit distance; gap penalty

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q45: Formal languages and automata

68Q42: Grammars and rewriting systems

68W32: Algorithms on strings

Uses Software

• Algorithm 97