Formal languages
Introduction to algorithms
Handbook of formal languages, vol. 1
A hash code method for detecting and correcting spelling errors
Communications of the ACM
Introduction to Algorithms: A Creative Approach
Introduction to Algorithms: A Creative Approach
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Fast Implementations of Automata Computations
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
| Hi-index | 0.00 |
We study automata-theoretic properties of distances and quasi-distances between words. We show that every additive distance is finite. We also show that every additive quasi-distance is regularitypreserving, that is, the neighborhood of any radius of a regular language with respect to an additive quasi-distance is regular. As an application we present a simple algorithm that constructs a metric (fault-tolerant) lexical analyzer for any given lexical analyzer and desired radius (fault-tolerance index).