EQUIVALENT STOCHASTIC SEQUENTIAL MACHINES

Abstract

This analysis is concerned with some structural properties of the probabilistic finite-state machines which were introduced as models for noisy communication channels. Procedures are given for the detection and elimination of superfluous states in machine descriptions. The point of view can be regarded as a probabilistic analog of deterministic finite-state machines. The equivalent states of a stochastic machine can be merged, as in the deterministic case, to yield a reduced form. Deterministic machines have unique reduced forms, but stochastic machines may possess a family of distinct reduced forms; a computational procedure for the determination of this family is discussed and some examples are given. (Author)

Document Details

Document Type
Technical Report
Publication Date
Nov 14, 1961
Accession Number
AD0277367

Entities

People

  • J.w. Carlyle

Organizations

  • University of California, Berkeley

Tags

DTIC Thesaurus Topics

  • Communication Channels
  • Detection
  • Structural Properties

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Statistical inference.