Some Characteristics of Finite Automata Generated by Single State
Yi Zhong · Gongcheng shuxue xuebao · 2011
This paper investigates the weakly invertible and decomposable properties of the finite automata generated by a single state.To prove whether a finite automation generated by a single state is weakly invertible,some necessary and sufficient conditions are shown.Moreover,for a weakly invertible finite automation(WIFA for short) M with delay τ generated by a single state,M can be decomposed into a WIFA with delay 0 and a τ-order unit if and only if the τ-output weight of the generator of M is 1.