Deciding word neighborhood with universal neighborhood automata

DOI10.1016/j.tcs.2011.01.013zbMath1216.68150OpenAlexW1989941956MaRDI QIDQ533878

Petar Mitankin, Stoyan Mihov, Klaus U. Schulz

Publication date: 10 May 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.01.013

zbMATH Keywords

dynamic programmingfinite state automataLevenshtein distance

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Dynamic programming (90C39)

Related Items (1)

Computation of Similarity—Similarity Search as Computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Synchronized rational relations of finite and infinite words
• The growth ratio of synchronous rational relations is unique
• Fast Approximate Search in Large Dictionaries
• Algorithms for approximate string matching
• Biological Sequence Analysis
• Algorithms on Strings, Trees and Sequences
• The String-to-String Correction Problem
• Asynchronous sliding block maps
• EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS

This page was built for publication: Deciding word neighborhood with universal neighborhood automata