A simplification of the basic theorem on automata

Studia Logica 26 (1):35 - 44 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1007/bf02283843

Links

PhilArchive



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

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

Combinatorial properties of some cellular automata related to the mosaic cycle concept.Claude Lobry & Hervé Elmoznino - 2000 - Acta Biotheoretica 48 (3-4):219-242.
Remarks on the notion of equivalence of automata.Jerzy Nowak - 1973 - Studia Logica 31 (1):153 - 158.
Automata for Epistemic Temporal Logic with Synchronous Communication.Swarup Mohalik & R. Ramanujam - 2010 - Journal of Logic, Language and Information 19 (4):451-484.
A theory of finite many-output automata defined by matrices.Jerzy Nowak - 1969 - Studia Logica 24 (1):55 - 81.
On a certain congruence of automata with respect to connecting and coupling with retardation.Jerzy Nowak - 1973 - Studia Logica 31 (1):159 - 165.
Modifiable automata self-modifying automata.J.-P. Moulin - 1992 - Acta Biotheoretica 40 (2-3):195-204.
Continuous Spatial Automata.B. J. MacLennan - unknown
A simplification of basic logic.Frederic B. Fitch - 1953 - Journal of Symbolic Logic 18 (4):317-325.
“The connection between prudential goodness and moral permissibility”, journal of social philosophy 24 (1993): 105-28.Peter Vallentyne - 1993 - Journal of Social Philosophy 24 (2):105-28.
Weak Cardinality Theorems.Till Tantau - 2005 - Journal of Symbolic Logic 70 (3):861 - 878.

Analytics

Added to PP
2009-01-28

Downloads
30 (#533,217)

6 months
3 (#976,418)

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

Add more references