Techniques for automatically correcting words in text
ACM Computing Surveys (CSUR)
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Handbook of formal languages, vol. 1: word, language, grammar
Handbook of formal languages, vol. 1: word, language, grammar
An algebra of discrete channels that involve combinations of three basic errors types
Information and Computation
Error Corrections for Channels with Substitutions, Insertions, and Deletions
Selected Papers from the 4th Canadian Workshop on Information Theory and Applications II
Codes, involutions, and DNA encodings
Formal and natural computing
Communication Networks
Computing the edit distance of a regular language
Information and Computation
Maximal error-detecting capabilities of formal languages
Journal of Automata, Languages and Combinatorics
DNA coding using the subword closure operation
DNA13'07 Proceedings of the 13th international conference on DNA computing
Computing Maximal Error-detecting Capabilities and Distances of Regular Languages
Fundamenta Informaticae
What is a maximal error-detecting capability of a formal language?
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Computing the edit-distance between a regular language and a context-free language
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Approximate matching between a context-free grammar and a finite-state automaton
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
Errors appear in a wide range of information processing and transmission applications, such as data communications, biological computing, computer typesetting, speech recognition, etc. It can be said indeed that errors are truly natural phenomena. In this work we introduce error or edit systems (e-systems, for short), which are formal languages over the alphabet of the basic edit operations. Our formalism allows one to model essentially any kind of error situations. For certain natural regular e-systems, we investigate their descriptional complexity in terms of the number of states of the automata accepting such systems. This problem is of interest in its own right as well as in the computation of maximal error-correcting capabilities of known languages.