Skip to main content
SpringerLink
Log in

Rational equivalence relations

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 226))

Included in the following conference series:

Abstract

Rational relations (finite transductions) which are equivalence relations are discussed. After establishing a containment hierarchy, the complexity of canonical function computation and a number of class membership decision problems are studied. The following classes are considered:

  1. (1)

    Rational Equivalence Relations,

  2. (2)

    Equivalence Kernels of Rational Functions,

  3. (3)

    Deterministic Rational Equivalence Relations,

  4. (4)

    Equivalence Kernels of Subsequential Functions,

  5. (5)

    Recognizable Equivalence Relations,

  6. (6)

    Length-bounded Rational Equivalence Relations, and

  7. (7)

    Finite Equivalence Relations.

Except for one open case ((1) = (2)?), Hasse diagrams are given to show the relative containments in the general and one-letter-alphabet cases. Canonical function application for an input of length n is shown to be O(n 2) time and space for (1), O(n) time and space for (2), (3), and (6), and O(n) time and constant space for the others. It is shown that transitivity, symmetry, reflexivity, and membership in any of (1) through (5) are undecidable properties for rational relations whereas membership in (6) or (7) is decidable.

Work supported by the Natural Sciences and Engineering Research Council of Canada, Grant No. A0237

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jean Berstel. Transductions and Context-Free Languages. B. G. Teubner, Stuttgart, Germany, 1979.

    Google Scholar 

  2. Christian Choffrut. Une caractérisation des fonctions séquentielles et des fonctions sous-séquentielles en tant que relations rationnelles. Theoretical Computer Science, 5:325–338, 1977.

    Google Scholar 

  3. Leon Davidson. Retrieval of misspelled names in an airlines passenger record system. Communications of the ACM, 5(3):169–171, 1962.

    Google Scholar 

  4. Samuel Eilenberg. Automata, Languages, and Machines, vol. A. Academic Press, New York, 1974.

    Google Scholar 

  5. C. C. Elgot and J. E. Mezei. On relations defined by generalized finite automata. IBM Journal of Research, 9:47–65, 1965.

    Google Scholar 

  6. Patrick C. Fischer and Arnold L. Rosenberg. Multitape one-way nonwriting automata. Journal of Computer and System Sciences, 2:88–101, 1968.

    Google Scholar 

  7. Ivan P. Fellegi and Alan B. Sunter. A theory of record linkage. Journal of the Americal Statistical Association, 64:1183–1210, 1969.

    Google Scholar 

  8. Seymour Ginsburg. The Mathematical Theory of Context-Free Languages. McGraw-Hill, New York, 1966.

    Google Scholar 

  9. J. Howard Johnson. Formal Models for String Similarity. PhD thesis, University of Waterloo, 1983. Available as University of Waterloo Research Report CS-83-32.

    Google Scholar 

  10. J. Howard Johnson. Do rational equivalence relations have regular cross-sections? In Proceedings of the 12th International Conference on Automata, Languages, and Programming, pages 300–309, Springer-Verlag LNCS 194, 1985.

    Google Scholar 

  11. Donald E. Knuth. Sorting and Searching. Addison-Wesley, Reading, Mass., 1973.

    Google Scholar 

  12. Gwendolyn B. Moore, John L. Kuhns, Jeffrey L. Trefftzs, and Christine A. Montgomery. Accessing Individual Records from Personal Data Files using Non-unique Identifiers. Technical Report NBS Special Publication 500-2, U.S. Dept. of Commerce—National Bureau of Standards, 1977. Available from the National Technical Information Service.

    Google Scholar 

  13. H. B. Newcombe and J. M. Kennedy. Record linkage: making maximum use of the discriminating power of identifying information. Communications of the ACM, 5(11):563–566, 1962.

    Google Scholar 

  14. M. P. Schützenberger. A remark on finite transducers. Information and Control, 4:185–196, 1961.

    Google Scholar 

  15. M. P. Schützenberger. Sur les relations rationelles. In Automata theory and formal languages: 2nd GI Conference, pages 209–213, 1975.

    Google Scholar 

  16. Gio Wiederhold. Database Design. McGraw-Hill, New York, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    J. Howard Johnson

Authors
  1. J. Howard Johnson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Laurent Kott

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Johnson, J.H. (1986). Rational equivalence relations. In: Kott, L. (eds) Automata, Languages and Programming. ICALP 1986. Lecture Notes in Computer Science, vol 226. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16761-7_66

Download citation

  • DOI: https://doi.org/10.1007/3-540-16761-7_66

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16761-7

  • Online ISBN: 978-3-540-39859-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation