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

DOI10.1007/978-3-642-39274-0_14zbMath1298.68137OpenAlexW1779305186MaRDI QIDQ5327490

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

Publication date: 7 August 2013

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39274-0_14

zbMATH Keywords

context-free grammarsfinite-state automataapproximate matchingedit-distance

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (3)

Decidability of involution hypercodes ⋮ Finite Approximations and Similarity of Languages ⋮ Efficient algorithms for computing the inner edit distance of a regular language via transducers

This page was built for publication: Approximate Matching between a Context-Free Grammar and a Finite-State Automaton