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

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.
A bibliography of the published work of Jerzy słupecki.Jan Zygmunt - 1989 - Studia Logica 48 (4):413 - 421.
Jerzy słupecki (1904–1987): Life and work.Jan Woleński & Jan Zygmunt - 1989 - Studia Logica 48 (4):401 - 411.
Remarks on the notion of equivalence of automata.Jerzy Nowak - 1973 - Studia Logica 31 (1):153 - 158.
Two definitions of the equivalence of automata.Ryszard Nowakowski - 1970 - Studia Logica 26 (1):7 - 17.
A definability criterion for the functions in łukasiewicz's matrices.T. Prucnal - 1968 - Studia Logica 23 (1):77-77.
A simplification of the basic theorem on automata.Jerzy Nowak - 1970 - Studia Logica 26 (1):35 - 44.
On a certain congruence of automata with respect to connecting and coupling with retardation.Jerzy Nowak - 1973 - Studia Logica 31 (1):159 - 165.
Propositional logic for topology-like matrices: a calculus with restricted substitution.Thomas M. Leschine - 1978 - Studia Logica 37 (2):161-165.

Analytics

Added to PP
2009-01-28

Downloads
71 (#831,714)

6 months
6 (#1,537,359)

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