Stochastic Automata, Stochastic Languages, and Pattern Recognition,

Abstract

The paper describes some relations between stochastic automata and stochastic languages, and the possible application of stochastic languages to pattern recognition problems. Stochastic finite-state and stochastic context-free languages are defined. The problem of probability assignment in stochastic languages is discussed. The properties of stochastic finite automata and stochastic pushdown automata used as acceptors are investigated. The use of formal languages in pattern recognition problems is illustrated. The potential application of stochastic languages for pattern description is demonstrated, and the possibility of employing stochastic automata as pattern classifiers is discussed. (Author)

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1970
Accession Number
AD0719801

Entities

People

  • King Sun Fu

Organizations

  • Purdue University

Tags

DTIC Thesaurus Topics

  • Automata
  • Computer Languages
  • Formal Languages
  • Language
  • Machine Learning
  • Pattern Recognition
  • Probability
  • Recognition

Fields of Study

  • Computer science

Readers

  • Artificial Intelligence
  • Mathematical Modeling and Probability Theory.

Technology Areas

  • AI & ML
  • AI & ML - Machine Learning Algorithms
  • AI & ML - Machine Translation