Abstract

The application of the finite automaton theory to the problem of program testing is discussed. The problem is reduced to testing a finite automaton. Testing of automatons using their state graphs, factor graphs, testing using factor graphs, and methods for factor graphs construction are discussed.