This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
April 1982 (vol. 31 no. 4)
pp. 327-328
E. Tanaka, Department of Information Science, Utsunomiya University
In our earlier paper1 we proposed an algorithm S for error-correcting parsing of formal languages. It is found recently that two additional CS conditions and a routine for detecting infinite loop are required for the algorithm S.
Citation:
E. Tanaka, null King Sun Fu, "Correction to "Error-Correcting Parsers for Formal Languages"," IEEE Transactions on Computers, vol. 31, no. 4, pp. 327-328, April 1982, doi:10.1109/TC.1982.1676001
Usage of this product signifies your acceptance of the Terms of Use.