On the Languages Representable by Finite Probabilistic Automata

Mathematical Logic Quarterly 17 (1):427-442 (1971)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1002/malq.19710170147

Links

PhilArchive



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

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

On the Languages Representable by Finite Probabilistic Automata.Phan Dinh Diêu - 1971 - Mathematical Logic Quarterly 17 (1):427-442.
Probabilistic Grammars and Languages.András Kornai - 2011 - Journal of Logic, Language and Information 20 (3):317-328.
Basic Properties of Quantum Automata.Stanley Gudder - 2000 - Foundations of Physics 30 (2):301-319.
Finite algebras of relations are representable on finite sets.H. Andréka, I. Hodkinson & I. Németi - 1999 - Journal of Symbolic Logic 64 (1):243-267.
Topological complexity of locally finite ω-languages.Olivier Finkel - 2008 - Archive for Mathematical Logic 47 (6):625-651.
Objective bayesian probabilistic logic.Jon Williamson - 2008
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.
Deterministic automata simulation, universality and minimality.Cristian Calude, Elena Calude & Bakhadyr Khoussainov - 1997 - Annals of Pure and Applied Logic 90 (1-3):263-276.
Relating word and tree automata.Orna Kupferman, Shmuel Safra & Moshe Y. Vardi - 2006 - Annals of Pure and Applied Logic 138 (1):126-146.
Automata for Epistemic Temporal Logic with Synchronous Communication.Swarup Mohalik & R. Ramanujam - 2010 - Journal of Logic, Language and Information 19 (4):451-484.
Behaviorism, finite automata, and stimulus response theory.Raymond J. Nelson - 1975 - Theory and Decision 6 (August):249-67.
Theory of Finite Automata: With an Introduction to Formal Languages.John Carroll & Darrell Long - 1989
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.

Analytics

Added to PP
2016-02-04

Downloads
29 (#550,291)

6 months
5 (#637,009)

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

No references found.

Add more references