The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (1982 vol.31)
pp: 327-328
E. Tanaka , Department of Information Science, Utsunomiya University
ABSTRACT
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.
INDEX TERMS
null
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
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool