Pseudomorphisms of automata
M.W. Warner · Czech digital mathematics library · 1983
A pseudomorphism between the automata {X, Q) and (X', Q') is defined as a class of pairs a: X X Q -.> X', /?: Q~> Q' which preserve the relation "q2 may be obtained from qx by applying an elementary input".Pseudomorphisms provide simplicial maps between the complexes associated with this relation.They can be linked with the automata homomorphisms of the classical theory by means of cascade products.Pseudo-isomorphisms are also discussed and an example given in which a is not surjective.Under some (pseudo-) homogeneity conditions an automaton is pseudo-isomorphic to a group quotient automaton.