Doner John. Tree acceptors and some of their applications. Journal of computer and system sciences, vol. 4 , pp. 406–451 [Book Review]

Journal of Symbolic Logic 37 (3):619-619 (1972)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272789

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,283

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

Review: John Doner, Tree Acceptors and Some of their Applications. [REVIEW]Dirk Siefkes - 1972 - Journal of Symbolic Logic 37 (3):619-619.
Computer vision for artists and designers: pedagogic tools and techniques for novice programmers. [REVIEW]Golan Levin - 2006 - AI and Society 20 (4):462-482.
Cleave John. The primitive recursive analysis of ordinary differential equations and the complexity of their solutions. Journal of computer and system sciences, vol. 3 , pp. 447–455. [REVIEW]Webb Miller - 1974 - Journal of Symbolic Logic 39 (2):345-346.
Report on DARPA Workshop on Self-Aware Computer Systems.Michael L. Anderson - unknown
Alfred Tarski and decidable theories.John Doner & Wilfrid Hodges - 1988 - Journal of Symbolic Logic 53 (1):20-35.
Tree formulations of tense logic.Jack Copeland - manuscript
Fundamenta Mathematica. [REVIEW]John E. Doner - 2003 - Bulletin of Symbolic Logic 9 (1):49-50.
Discrete Mathematics.S. K. Chakraborty & B. K. Sarkar - 2011 - Oxford University Press India.
Natural Computation Techniques Applications-Chaotically Masking Traffic Pattern to Prevent Traffic Pattern Analysis Attacks for Mission Critical Applications in Computer Communication Networks.Ming Li & Huamin Feng - 2006 - In O. Stock & M. Schaerf (eds.), Lecture Notes in Computer Science. Springer Verlag. pp. 4222--448.
The function and process of perception.Jonathan F. Doner & Joseph S. Lappin - 1980 - Behavioral and Brain Sciences 3 (3):383-384.
Review: Robert R. Korfhage, Logic and Algorithms with Applications to the Computer and Information Sciences. [REVIEW]Jiri Becvar - 1971 - Journal of Symbolic Logic 36 (2):344-346.
Definition 1.1. 1. A tree is a subset T of< such that for all∈ T, if∈< and⊆, then∈ T. 2. If T is a tree and S⊆ T is also a tree, we say that S is a subtree of T. 3. A tree T is bounded if there exists h:→ such that for all∈ T. [REVIEW]Joseph R. Mileti - 2005 - Bulletin of Symbolic Logic 11 (3).
Offering bonuses for reduced fertility.Stephen Enke & Bryan D. Hickman - 1973 - Journal of Biosocial Science 5 (3):329-346.
Lewis F. D.. The enumerability and invariance of complexity classes. Journal of computer and system sciences, vol. 5 , pp. 286–303. [REVIEW]Nancy A. Lynch - 1974 - Journal of Symbolic Logic 39 (2):349-349.
Blum E. K.. Towards a theory of semantics and compilers for programming languages. Journal of computer and system sciences, vol. 3 , pp. 248–275. [REVIEW]David Park - 1975 - Journal of Symbolic Logic 40 (3):470-471.

Analytics

Added to PP
2016-06-30

Downloads
10 (#1,199,114)

6 months
1 (#1,478,456)

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