A Simple Proof of a Theorem on Self-Synchronizing Automata

Abstract

A short proof is offered for verifying that a finite state, completely specified automaton is synchronized with probability 1 only if there exists a universal synchronizer for the automaton.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1965
Accession Number
AD0622764

Entities

People

  • Dale M. Landi

Organizations

  • RAND Corporation

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Alphabets
  • Automata
  • Automation
  • California
  • Coding
  • Continents
  • Corporations
  • Geographic Regions
  • Identities
  • Illinois
  • Mathematics
  • New York
  • North America
  • Probability
  • Sequences
  • Transitions

Fields of Study

  • Mathematics