The Source as a Tool in Automata
暂无分享,去创建一个
The source of a set of states of an automaton is introduced as the set of all predecessors of members of the set. The source is shown to be a valuable tool in proofs; it is also shown to provide new insights and directions in automata theory. Relationships are explored between the source on the one hand and, on the other, subautomata, primaries, blocks, connectivity, separation, strong connectedness, retrievability, Abelian automata, homomorphisms, and other concepts.
[1] David E. Muller,et al. Connectivity and Reversibility in Automata , 1970, JACM.
[2] Zamir Bavel,et al. On the Decomposability of Monadic Algebras and Automata , 1967, SWAT.
[3] Zamir Bavel,et al. Structure and Transition-Preserving Functions of Finite Automata , 1968, JACM.