On the Automorphism Group of a Reduced Automaton

  title={On the Automorphism Group of a Reduced Automaton},
  author={Manfred Paul},
  booktitle={Scandinavian Workshop on Algorithm Theory},
  • M. Paul
  • Published in
    Scandinavian Workshop on…
    26 October 1966
  • Mathematics
In this paper we shall investigate the automorphism group G(A/H) of the reduced automaton A/H where A = (S, I, M) is a finite strongly connected automaton and H is a subgroup of the automorphism group G(A) of the automaton A. This problem and other related topics have been dealt with recently by G. P. Weeg, A. C. Fleck, and B. Barnes.1,2,3,4,5 However, the particular problem to give an isomorphic representation of G(A/H) for arbitrary A and H still remained open. Our present purpose is to fill… 

On Endomorphisms and Congruences of Automata

The structure connections between the endomorphisms, automorphisms, and all congruence relations of an arbitrary, not necessarily finite or strongly connected automaton are investigated. It is shown

Some results on the set of congruence relations in a finite, strongly connected automaton

  • P. Deussen
  • Mathematics, Computer Science
  • 2005
Some theoretical background for a systematic procedure in obtaining all congruence relations of an automaton as well as its endomorphism semigroup has been developed.



Automorphism Groups and Quotients of Strongly Connected Automata and Monadic Algebras

Applications to decomposition theory, in particular to the problem of factoring out identical parallel front components, are given and a generalization of the major parts of the theory to infinite strongly connected monadic algebras is obtained.

Isomorphism Groups of Automata

  • A. Fleck
  • Computer Science, Mathematics
  • 1962
For a certain class of automata a necessary and sufficient condition, in terms of the group of the automaton, is given for insuring that an automaton can be represented as a direct product.

The Structure of an Automaton and Its Operation-Preserving Transformation Group

The main result shows the group of operation-preserving transformations of a strongly connected au tomaton onto itself is isomorphic to a group of subsets of input sequences under a certain operation.

Groups of Automorphisms and Sets of Equivalence Classes of Input for Automata

An investigation is presented which continues the work of Fleck and Weeg concerning the relationships between the equivalence classes of inputs and the group of automorphisms of a finite automaton.

On the Automorphism Group of an Automaton

The algebraic properties of automata are investigated. The automorphism group of an automaton and a certain associated semigroup are the devices used ir~ the study. Some relationships among various

Group-Type Automata

The purpose is to investigate the input structure of automata which have a group-like character. The class of perfect automata investigated by Fleck in [2] and Weeg in [6] is a proper subclass of

Die Isomorphismengruppe der freien Gruppen


  • 107:367–386,
  • 1933