id: 03999303
dt: a
an: 03999303
au: Chmiel, K.; Mikołajczak, B.
ti: A comparison of structural properties of automata with respect to different
    morphisms.
so: Algebra, combinatorics and logic in computer science, Colloq. Györ/Hung.
    1983, Vol. 1, Colloq. Math. Soc. János Bolyai 42, 201-211 (1986).
py: 1986
pu: 
la: EN
cc: 
ut: deterministic finite automata; behavior
ci: Zbl 0593.00024
li: 
ab: [For the entire collection see Zbl 0593.00024.] This paper deals with the
    influence of different morphisms of deterministic finite automata on
    their behavior. Various properties of automata with respect to such
    morphisms like: state homomorphisms, state isomorphisms, generalized
    homomorphisms and generalized isomorphisms are considered. Among these
    properties are: set of successors, set of predecessors, genetic set,
    set of generators, subautomaton, primary, and connectivity properties
    such as: connectedness, strong connectedness, retrievability,
    semiretrievability, reversibility, partial reversibility, potential
    reversibility, onto-property and reflexiveness. The fundamental
    question we are dealing with in this paper is the following: is the
    property of finite automata under consideration preserved with respect
    to different morphisms of automata?
rv: