Deciding word neighborhood with universal neighborhood automata
type: Item
instance of: scholarly article
title: Deciding word neighborhood with universal neighborhood automata
zbMATH Open document ID: 1216.68150
author: Petar Mitankin
author: Stoyan Mihov
author: K. U. Schulz
published in: Theoretical Computer Science
publication date: 2011-05-10T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 5886215
zbMATH Keywords: dynamic programming
zbMATH Keywords: finite state automata
zbMATH Keywords: Levenshtein distance
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.01.013
OpenAlex ID: W1989941956
cites work: Fast Approximate Search in Large Dictionaries
cites work: Algorithms on Strings, Trees and Sequences
cites work: Biological Sequence Analysis
cites work: EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS
cites work: The String-to-String Correction Problem
cites work: Algorithms for approximate string matching
cites work: Q3862379
cites work: Q5528329
cites work: Q4079524
cites work: Synchronized rational relations of finite and infinite words
cites work: Asynchronous sliding block maps
cites work: The growth ratio of synchronous rational relations is unique
DOI: 10.1016/J.TCS.2011.01.013
description: scientific article; zbMATH DE number 5886215