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

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.