Error detection using regular languages

  • P. Prusinkiewicz
Part of the Lecture Notes in Computer Science book series (LNCS, volume 45)


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.

Key words

error detection finite automata transductions 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  1. [1]
    A. Blikle: Automaty i gramatyki. Wstęp do lingwistyki matematycznej. 1971 Warszawa.Google Scholar
  2. [2]
    C. C. Elgot, J. E. Mezei: On relations defined by generalized finite automata. IBM J. Res. Develop. pp. 47–68, January 1965.Google Scholar
  3. [3]
    W. W. Peterson: Error-correcting codes. 1961 New York.Google Scholar
  4. [4]
    W. B. Smith: Error detection in formal languages. J. Comp. Syst. Sci. vol. 4 pp. 385–405, 1970.Google Scholar
  5. [5]
    R. E. Stearns, J. Hartmanis: Regularity preserving modifications of regular expressions. Inf. Control vol. 6 pp. 55–69, 1963.CrossRefGoogle Scholar
  6. [6]
    M. C. Thomason: Errors in regular languages. IEEE Trans. Comput. vol. C-23 pp. 597–602, June 1974.Google Scholar
  7. [7]
    S. Winograd: Input error limiting automata. J. ACM vol. 11 pp. 338–351, 1964.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • P. Prusinkiewicz
    • 1
  1. 1.Institute of Computer ScienceWarsaw Technical UniversityWarsawPoland

Personalised recommendations