A theory of finite many-output automata defined by matrices

Studia Logica 24 (1):55 - 81 (1969)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1007/bf02134299

Other Versions

No versions found

Links

PhilArchive



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

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

A structural theory of matrix-defined finite automata.R. Nowakowski - 1965 - Studia Logica 16 (1):115-116.
Constructing denumerable matrices strongly adequate for pre-finite logics.Ewa Graczyńska & Andrzej Wroński - 1974 - Studia Logica 33 (4):417 - 423.
Behaviorism, finite automata, and stimulus response theory.Raymond J. Nelson - 1975 - Theory and Decision 6 (August):249-67.
On reduced matrices.Wolfgang Rautenberg - 1993 - Studia Logica 52 (1):63 - 72.
A note on direct products and ultraproducts of logical matrices.Jan Zygmunt - 1974 - Studia Logica 33 (4):349 - 357.
Finite basis theorem for Filter-distributive protoalgebraic deductive systems and strict universal horn classes.Katarzyna Pałasińska - 2003 - Studia Logica 74 (1-2):233 - 273.
On structural completeness of many-valued logics.Piotr Wojtylak - 1978 - Studia Logica 37 (2):139 - 147.
Finite Model Theory.Heinz-Dieter Ebbinghaus & Torg Flum - 1997 - Studia Logica 58 (2):332-335.

Analytics

Added to PP
2009-01-28

Downloads
45 (#491,321)

6 months
12 (#290,681)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Remarks on the notion of equivalence of automata.Jerzy Nowak - 1973 - Studia Logica 31 (1):153 - 158.

Add more citations

References found in this work

Add more references