This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Errors in Regular Languages
June 1974 (vol. 23 no. 6)
pp. 597-602
M.G. Thomason, Department of Computer Science, University of Tennessee
Random occurrences of three types of errors in the input to a finite automaton are considered: an a error is a deletion of one symbol from the input string; a ? error is an insertion of one extra symbol; and a d error is a change of one symbol into another symbol. A method using operators for determining regular expressions defining error-corrupted strings is developed and is employed in the construction of a finite automaton, the outputs of which are stochastically generated by Bayes' Rule (with certain approximations) to take into account the frequencies with which strings appear as inputs and the probabilities of errors.
Index Terms:
Bayes' rule, errors in inputs, error operators, finite automata, regular expressions, regularity-preserving errors, stochastic automata.
Citation:
M.G. Thomason, "Errors in Regular Languages," IEEE Transactions on Computers, vol. 23, no. 6, pp. 597-602, June 1974, doi:10.1109/T-C.1974.224000
Usage of this product signifies your acceptance of the Terms of Use.