Retractable state-finite automata without outputs


A homomorphism of an automaton A without outputs onto a subau-tomaton B of A is called a retract homomorphism if it leaves the elements of B fixed. An automaton A is called a retractable automaton if, for every subautomaton B of A, there is a retract homomorphism of A onto B. In [1] and [3], special retractable automata are examined. The purpose of this… (More)


Cite this paper

@article{Nagy2004RetractableSA, title={Retractable state-finite automata without outputs}, author={Attila Nagy}, journal={Acta Cybern.}, year={2004}, volume={16}, pages={399-409} }