On the Automorphism Group of a Reduced Automaton.
Report No. 200, Dept. of Computer Science, University of Illinois, Urbana, Ill., February 22, 1966; 15 pages, references.
Condition: Very Good overall, turquoise-blue and white cardstock covers with illustration of punched card on cover front, bound stapled wraps with cloth tape along spine. A bit of shelfwear, rubberstamp of corporation address on front cover. Sound and secure binding, clean and unmarked pages.
Keywords: On the Automorphism Group of a Reduced Automaton, Manfred Paul, 7th Annual Symposium on Switching and Automata Theory, history of computing at university of illinois
Categories: 1960's computers and computing, Computer Science, Mathematics
See all items by Manfred Paul
Item DescriptionIn 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 this gap.
Also published in the Proceedings of the 7th Annual Symposium on Switching and Automata Theory, 1966.