Closest substring problems for regular languages

DOI10.1007/978-3-319-98654-8_32OpenAlexW2885815372MaRDI QIDQ5915558

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

Publication date: 22 November 2018

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

Full work available at URL: https://doi.org/10.1007/978-3-319-98654-8_32

zbMATH Keywords

computational complexityregular languagesedit distanceclosest substring problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Closest substring problems for regular languages