• DocumentCode
    920212
  • Title

    Testing a simple symmetric hypothesis by a finite-memory deterministic algorithm

  • Author

    Shubert, Bruno O. ; Anderson, Calvin M.

  • Volume
    19
  • Issue
    5
  • fYear
    1973
  • fDate
    9/1/1973 12:00:00 AM
  • Firstpage
    644
  • Lastpage
    647
  • Abstract
    A class of finite-memory deterministic algorithms is introduced and investigated. Optimum algorithms are found for small numbers (up to 21) of states. The algorithms provide their own stopping rules.
  • Keywords
    Decision procedures; Finite-memory methods; Absorption; Counting circuits; Error probability; Operations research; Random variables; Tail; Testing;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.1973.1055082
  • Filename
    1055082
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=920212