WorldCat Identities

Rabin, M. O.

Overview
Works: 6 works in 6 publications in 1 language and 12 library holdings
Classifications: QA9, 510
Publication Timeline
.
Most widely held works by M. O Rabin
Automata on infinite objects and Church's problem by Michael Oser Rabin( Book )

1 edition published in 1972 in English and held by 4 WorldCat member libraries worldwide

This volume is an outgrowth of a series of lectures presented at the CBMS Regional Conference held at Morehouse College, Atlanta, Georgia, on September 8-12, 1969. The purpose of these notes, which present results reported here for the first time, is twofold. First, to give a quick overview of certain aspects of the mathematical theory of automata and to prove in detail a number of deeper results in this subject. Second, to combine and utilize the various methods, chiefly the method of automata on infinite trees, to obtain a simple and transparent solution of Church's solvability problem
Essays on the foundations of mathematics : dedicated to A.A. Fraenkel on his seventieth anniversary by Universiṭah ha-ʻIvrit bi-Yerushalayim( Book )

1 edition published in 1962 in English and held by 3 WorldCat member libraries worldwide

THEORIES OF COMPUTATION( Book )

1 edition published in 1970 in English and held by 2 WorldCat member libraries worldwide

The work on Theories of Computation by Y. Bar-Hillel, E. Shamir, A. Levy, H. Gaifman, M. Rabin, B. Gabbay, M. Magidor and G. Moran is briefly reported. A bibliography of seventeen technical reports and articles containing the results of this effort is given. (Author)
Probabilistic algorithms by Thomas J. Watson IBM Research Center( Book )

1 edition published in 1976 in English and held by 1 WorldCat member library worldwide

The theory of definite automata by M Perles( Book )

1 edition published in 1961 in English and held by 1 WorldCat member library worldwide

The notion of a definite event introduced by Kleene as well as the related concepts of definite automata and tables are studied in detail. Results relating to the minimum number of states required for synthesizing an automaton of a given degree of definiteness are proved. Various decision and synthesis problems pertaining to definite automata are effectively solved. (Author)
Efficient randomized pattern-matching algorithms by Harvard University( Book )

1 edition published in 1981 in English and held by 1 WorldCat member library worldwide

 
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.74 (from 0.64 for Automata o ... to 0.90 for THEORIES O ...)

Languages