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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,553

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

J. Hartmanis and J. E. Hopcroft. What makes some language theory problems undecidable. Journal of computer and system sciences, vol. 4 , pp. 368–376. [REVIEW]Patrick C. Fischer - 1975 - Journal of Symbolic Logic 40 (2):245-246.
Webb Miller. Recursive function theory and numerical analysis. Journal of computer and system sciences vol. 4 , pp. 465–472. [REVIEW]J. P. Cleave - 1974 - Journal of Symbolic Logic 39 (2):346.
D. C. Luckham, D. M. R. Park, and M. S. Paterson. On formalised computer programs. Journal of computer and system sciences, vol. 4 , pp. 220–249. [REVIEW]D. C. Cooper - 1974 - Journal of Symbolic Logic 39 (2):347.
Walter J. Savitch. Relationships between nondeterministic and deterministic tape complexities. Journal of computer and system sciences, vol. 4 , pp. 177–192. [REVIEW]Albert R. Meyer - 1974 - Journal of Symbolic Logic 39 (2):346-347.
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.
Dana Scott. Some definitional suggestions for automata theory. Journal of computer and system sciences, vol. 1 , pp. 187–212. [REVIEW]Robert F. Barnes - 1975 - Journal of Symbolic Logic 40 (4):615-616.
Patrick C. Fischer, Albert R. Meyer, and Arnold L. Rosenberg. Time-restricted sequence generation. Journal of computer and system sciences, vol. 4 , pp. 50–73. [REVIEW]Jiˇrí Bečvář - 1975 - Journal of Symbolic Logic 40 (4):616-617.
F. R. Drake. On McKinsey's syntactical characterizations of systems of modal logic. The journal of symbolic logic, vol. 27 no. 4 , pp. 400–406. [REVIEW]David Makinson - 1971 - Journal of Symbolic Logic 36 (4):691-692.
J. Richard Büchi. Finite automata, their algebras and grammars. Towards a theory of formal expressions. Edited by Dirk Siefkes. Springer-Verlag, New York, Berlin, Heidelberg, etc., 1989, xii + 316 pp. [REVIEW]Stephen L. Bloom - 1991 - Journal of Symbolic Logic 56 (2):762-763.

Analytics

Added to PP
2013-11-03

Downloads
30 (#763,638)

6 months
14 (#247,632)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A first-order axiomatization of the theory of finite trees.Rolf Backofen, James Rogers & K. Vijay-Shanker - 1995 - Journal of Logic, Language and Information 4 (1):5-39.
Querying linguistic treebanks with monadic second-order logic in linear time.Stephan Kepser - 2004 - Journal of Logic, Language and Information 13 (4):457-470.

Add more citations

References found in this work

No references found.

Add more references