A Property of Partially Specified Automata

A partially specified finite automation is one whose flow table is not completely specified. Given a partially specified automaton, we want to determine whether it is possible to complete its flow table so that the resultant automaton will have a finite memory span.

[1]  Micha A. Perles,et al.  The Theory of Definite Automata , 1963, IEEE Trans. Electron. Comput..

[2]  C. L. Liu.  Some memory aspects of finite automata. , 1963 .