Computing the Edit-Distance between a Regular Language and a Context-Free Language

DOI10.1007/978-3-642-31653-1_9zbMath1370.68171OpenAlexW2099378921MaRDI QIDQ3167486

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

Publication date: 2 November 2012

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31653-1_9

zbMATH Keywords

context-free languageregular languageedit-distanceLevenshtein distance

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

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: Computing the Edit-Distance between a Regular Language and a Context-Free Language