Rational Equivalence Relations
暂无分享,去创建一个
[1] Jean Berstel,et al. Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.
[2] J. Howard Johnson,et al. Do Rational Equivalence Relations have Regular Cross-Sections? , 1985, ICALP.
[3] Christian Choffrut,et al. Une Caracterisation des Fonctions Sequentielles et des Fonctions Sous-Sequentielles en tant que Relations Rationnelles , 1977, Theor. Comput. Sci..
[4] Leon Davidson,et al. Retrieval of misspelled names in an airlines passenger record system , 1962, CACM.
[5] Marcel Paul Schützenberger,et al. A Remark on Finite Transducers , 1961, Inf. Control..
[6] Marcel Paul Schützenberger,et al. Sur les relations rationnelles , 1975, Automata Theory and Formal Languages.
[7] Maurice Nivat,et al. Transduction des langages de Chomsky , 1968 .
[8] Gio Wiederhold,et al. Database Design , 1977 .
[9] Meera Blattner. Single-Valued a-Transducers , 1977, J. Comput. Syst. Sci..
[10] Mike Paterson,et al. A Faster Algorithm Computing String Edit Distances , 1980, J. Comput. Syst. Sci..
[11] Arnold L. Rosenberg,et al. Multitape One-Way Nonwriting Automata , 1968, J. Comput. Syst. Sci..
[12] Donald E. Knuth,et al. Sorting and Searching , 1973 .
[13] Ivan P. Fellegi,et al. A Theory for Record Linkage , 1969 .
[14] Gwendolyn B Moore,et al. Accessing Individual Records from Personal Data Files Using Nonunique Identifiers | NIST , 1977 .
[15] John Howard Johnson. Formal models for string similarity , 1983 .
[16] Malcolm Bird,et al. The Equivalence Problem for Deterministic Two-Tape Automata , 1973, J. Comput. Syst. Sci..
[17] Jorge E. Mezei,et al. On Relations Defined by Generalized Finite Automata , 1965, IBM J. Res. Dev..
[18] Howard B. Newcombe,et al. Record linkage: making maximum use of the discriminating power of identifying information , 1962, CACM.
[19] Seymour Ginsburg,et al. The mathematical theory of context free languages , 1966 .
[20] Jan van Leeuwen,et al. Efficient Recognition of Rational Relations , 1982, Inf. Process. Lett..