Abstract
The paper introduces formal definitions of sets of errors detectable and undetectable by a language. A method is given for determining these sets, when the language and a set of all possible errors are known. The method uses finite automata to define languages and sets of errors.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
6. References
A. Blikle: Automaty i gramatyki. Wstęp do lingwistyki matematycznej. 1971 Warszawa.
C. C. Elgot, J. E. Mezei: On relations defined by generalized finite automata. IBM J. Res. Develop. pp. 47–68, January 1965.
W. W. Peterson: Error-correcting codes. 1961 New York.
W. B. Smith: Error detection in formal languages. J. Comp. Syst. Sci. vol. 4 pp. 385–405, 1970.
R. E. Stearns, J. Hartmanis: Regularity preserving modifications of regular expressions. Inf. Control vol. 6 pp. 55–69, 1963.
M. C. Thomason: Errors in regular languages. IEEE Trans. Comput. vol. C-23 pp. 597–602, June 1974.
S. Winograd: Input error limiting automata. J. ACM vol. 11 pp. 338–351, 1964.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1976 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Prusinkiewicz, P. (1976). Error detection using regular languages. In: Mazurkiewicz, A. (eds) Mathematical Foundations of Computer Science 1976. MFCS 1976. Lecture Notes in Computer Science, vol 45. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07854-1_215
Download citation
DOI: https://doi.org/10.1007/3-540-07854-1_215
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07854-8
Online ISBN: 978-3-540-38169-3
eBook Packages: Springer Book Archive