Some Universal Elements for Finite Automata

, &
Journal of Symbolic Logic 35 (3):480-481 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270758

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

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: M. L. Minsky, J.E. McCarthy, C.E. Shannon, Some Universal Elements for Finite Automata. [REVIEW]Patrick C. Fischer - 1970 - Journal of Symbolic Logic 35 (3):480-481.
Modifiable automata self-modifying automata.J.-P. Moulin - 1992 - Acta Biotheoretica 40 (2-3):195-204.
Finite State Automata and Monadic Definability of Singular Cardinals.Itay Neeman - 2008 - Journal of Symbolic Logic 73 (2):412 - 438.
Finite Automata.F. H. George - 1958 - Philosophy 33 (124):57 - 59.
Automata presenting structures: A survey of the finite string case.Sasha Rubin - 2008 - Bulletin of Symbolic Logic 14 (2):169-209.
Deterministic automata simulation, universality and minimality.Cristian Calude, Elena Calude & Bakhadyr Khoussainov - 1997 - Annals of Pure and Applied Logic 90 (1-3):263-276.
Behaviorism, finite automata, and stimulus response theory.Raymond J. Nelson - 1975 - Theory and Decision 6 (August):249-67.
Review: M. P. Schutzenberger, On the Definition of a Family of Automata; M. P. Schutzenberger, Finite Counting Automata; M. P. Schutzenberger, Certain Elementary Families of Automata. [REVIEW]Michael O. Rabin - 1969 - Journal of Symbolic Logic 34 (2):296-297.
Review: C. Y. Lee, Automata and Finite Automata. [REVIEW]J. C. Shepherdson - 1971 - Journal of Symbolic Logic 36 (3):534-535.
Automata and Finite Automata.C. Y. Lee - 1971 - Journal of Symbolic Logic 36 (3):534-535.
Finite automata, real time processes and counting problems in bounded arithmetics.Mirosław Kutyłowski - 1988 - Journal of Symbolic Logic 53 (1):243-258.
Understanding Quantifiers in Language.Jakub Szymanik & Marcin Zajenkowski - 2009 - In N. A. Taatgen & H. van Rijn (eds.), Proceedings of the 31st Annual Conference of the Cognitive Science Society.
Finite state automata and simple recurrent networks.Axel Cleeremans & David Servan-Schreiber - unknown
Computational Semantics for Monadic Quantifiers.Marcin Mostowski - 1998 - Journal of Applied Non--Classical Logics 8 (1-2):107--121.
Elements of Finite Model Theory.Leonid Libkin - 2004 - Springer.

Analytics

Added to PP
2015-02-05

Downloads
22 (#666,248)

6 months
5 (#526,961)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Workers and Automata: A Sociological Analysis of the Italian Case.Riccardo Campa - 2014 - Journal of Evolution and Technology 24 (1):70-85.

Add more citations

References found in this work

No references found.

Add more references