Theory of probabilistic automata

[1]  D. Blackwell,et al.  On the Identifiability Problem for Functions of Finite Markov Chains , 1957 .

[2]  Peter H. Starke.  Einige Bemerkungen über nicht-deterministische Automaten , 1966, J. Inf. Process. Cybern..

[3]  Arthur Gill,et al.  On a Weight Distribution Problem, with Application to the Design of Stochastic Generators , 1963, JACM.

[4]  Arto Salomaa.  On m-adic Probabilistic Automata , 1967, Inf. Control..

[5]  Eli Brookner,et al.  Recurrent Events in a Markov Chain , 1966, Inf. Control..

[6]  Arthur Gill,et al.  Synthesis of probability transformers , 1962 .

[7]  John N. Warfield.  Synthesis of switching circuits to yield prescribed probability relations , 1965, SWCT.

[8]  R. W. Mclaren,et al.  A stochastic automaton model for the synthesis of learning systems , 1966 .

[9]  A. Thomasian,et al.  A Finite Criterion for Indecomposable Channels , 1963 .

[10]  Glenn C. Bacon,et al.  The Decomposition of Stochastic Automata , 1964, Inf. Control..

[11]  William J. Horvath.  Stochastic Models of Behavior , 1966 .

[12]  Jack W. Carlyle,et al.  On the External Probability Structure of Finite-State Channels , 1964, Inf. Control..

[13]  J. W. Carlyle.  EQUIVALENT STOCHASTIC SEQUENTIAL MACHINES , 1961 .

[14]  Carl V. Page,et al.  Equivalences between Probalistic and Deterministic Sequential Machines , 1966, Inf. Control..

[15]  E. J. Gilbert.  On the Identifiability Problem for Functions of Finite Markov Chains , 1959 .

[16]  Azaria Paz,et al.  Some aspects of Probabilistic Automata , 1966, Inf. Control..

[17]  Gerald M. White.  Penny Matching Machines , 1959, Inf. Control..

[18]  M. L. Tsetlin.  FINITE AUTOMATA AND MODELS OF SIMPLE FORMS OF BEHAVIOUR , 1963 .

[19]  Peter H. Starke,et al.  Stochastische Ereignisse und Wortmengen , 1966 .

[20]  A. Davis.  Markov Chains as Random Input Automata , 1961 .

[21]  George Adomian,et al.  Linear Stochastic Operators , 1963 .

[22]  J. Carlyle.  Reduced forms for stochastic sequential machines , 1963 .