Joyce Friedman. A decision procedure for computations of finite automata. Journal of the Association for Computing Machinery, vol. 9 , pp. 315–323 [Book Review]

Journal of Symbolic Logic 30 (2):248-249 (1965)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270154

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,449

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Joyce Friedman. A semi-decision procedure for the functional calculus. Journal of the Association for Computing Machinery, vol. 10 , pp. 1–24. - Joyce Friedman. A computer program for a solvable case of the decision problem. Journal of the Association for Computing Machinery, vol. 10 , pp. 348–356. [REVIEW]Frederic B. Fitch - 1964 - Journal of Symbolic Logic 29 (2):101.
Michael Arbib. Turing machines, finite automata and neural nets. Journal of the Association for Computing Machinery, vol. 8 , pp. 467–475. [REVIEW]Joseph S. Ullian - 1970 - Journal of Symbolic Logic 35 (3):482.
A Decision Procedure for Computations of Finite Automata.Joyce Friedman - 1965 - Journal of Symbolic Logic 30 (2):248-249.
Patterson G. W.. What is a code? Communications of the Association for Computing Machinery, vol. 3 no. 5 , pp. 315–318.Richard C. Jeffrey - 1965 - Journal of Symbolic Logic 30 (3):385-385.
Robert McNaughton. Testing and generating infinite sequences by a finite automaton. Information and control, vol. 9 , pp. 521–530. [REVIEW]Dirk Siefkes - 1972 - Journal of Symbolic Logic 37 (3):618.
Martin Davis and Hilary Putnam. A computing procedure for quantification theory. Journal of the Association for Computing Machinery, vol. 7 , pp. 201–215. [REVIEW]J. A. Robinson - 1966 - Journal of Symbolic Logic 31 (1):125-126.
Robert A. Dipaola. Random sets in subrecursive hierarchies. Journal of the Association for Computing Machinery, vol. 16 , pp. 621–630. [REVIEW]Donald W. Loveland - 1975 - Journal of Symbolic Logic 40 (2):249-250.
Dag Prawitz, Håkon Prawitz, and Neri Voghera. A mechanical proof procedure and its realization in an electronic computer.Journal of the Association for Computing Machinery, vol. 7 , pp. 102–128. [REVIEW]J. A. Robinson - 1966 - Journal of Symbolic Logic 31 (1):126-126.
Markov A. A.. Ob invérsionnoj složnosti sistém funkcij. Doklady Akadémii Nauk SSSR, vol. 116 , pp. 917–919.Markov A. A.. On the inversion complexity of a system of functions. English translation of the preceding by Morris D. Friedman. Journal of the Association for Computing Machinery, vol. 5 , pp. 331–334. [REVIEW]E. N. Gilbert - 1965 - Journal of Symbolic Logic 30 (3):378-379.
Robert McNaughton. Automata, formal languages, abstract switching, and computability in a Ph. D. computer science program. Communications of the ACM, vol. 11 (1968), pp. 738–740, 746. [REVIEW]Ann S. Ferebee - 1970 - Journal of Symbolic Logic 34 (4):656-656.

Analytics

Added to PP
2013-11-22

Downloads
20 (#1,084,435)

6 months
3 (#1,061,821)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references