Descriptional Complexity of Error Detection [chapter]

Timothy Ng, David Rappaport, Kai Salomaa
2016 Emergent Computation  
The neighbourhood of a language L consists of all strings that are within a given distance from a string of L. For example, additive distances or the prefixdistance are regularity preserving in the sense that the neighbourhood of a regular language is always regular. For error detection and error correction applications an important question is to determine the size of the minimal deterministic finite automaton (DFA) needed to recognize the neighbourhood of a language recognized by an n state
more » ... A. This paper surveys recent work on the state complexity of neighbourhoods of regularity preserving distances.
doi:10.1007/978-3-319-46376-6_6 fatcat:nngbjojjzvap3kwo4qa5lnlqg4