ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
On the Automorphism Group of an Automaton
Full text PdfPdf (229 KB)
Source Journal of the ACM (JACM) archive
Volume 12 ,  Issue 4  (October 1965) table of contents
Pages: 566 - 569  
Year of Publication: 1965
ISSN:0004-5411
Author
A. C. Fleck  Computer Center, University of Iowa, Iowa City, Iowa
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 23,   Citation Count: 3
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/321296.321307
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
A. C. Fleck, Isomorphism Groups of Automata, Journal of the ACM (JACM), v.9 n.4, p.469-476, Oct. 1962  [doi>10.1145/321138.321144]
 
2
WEEG, G. P. The group and semigroup associated with automata. Proc. Syrup. Math. Theory Automata, pp. 257-266. Polytechnic Press, 1962.
 
3
CLIFFORD, A. i ., AND PRESTON, G.B. The Algebraic Theory of Seemi-Groups. Math. Surveys No. 7, Amer. Math. Soc., Providence, R. I., 1961.
 
4
RABIN, M. O., AND SCOTT, D. Finite automata and their decision problems. IBM J. Res. Develop. 8, (Apr. 1959), 114-125.
 
5
HARTXMANS, J. Loop-free structure of sequential machines. Inform. Contr. 5, 1 (Mar. 1962), 25-43.

CITED BY  3
Jerzy W. Grzymala-Busse, Automorphisms of Polyadic Automata, Journal of the ACM (JACM), v.16 n.2, p.208-219, April 1969
Zamir Bavel, Structure and Transition-Preserving Functions of Finite Automata, Journal of the ACM (JACM), v.15 n.1, p.135-158, Jan. 1968
A. C. Fleck , S. T. Hedetniemi , R. H. Oehmke, S -Semigroups of Automata, Journal of the ACM (JACM), v.19 n.1, p.3-10, Jan. 1972

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
      F.1.1 Models of Computation
          Subjects: Automata (e.g., finite, push-down, resource-bounded)

Additional Classification:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS


General Terms:
Theory, Verification

Collaborative Colleagues:
A. C. Fleck: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player