Tape Sets and Automata

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Tape Sets and Automata

Full text

Pdf (217 KB)

Source

Journal of the ACM (JACM) archive
Volume 11 , Issue 1 (January 1964) table of contents

Pages: 10 - 14

Year of Publication: 1964

ISSN:0004-5411

Author

R. R. Brown

Michigan State University, East Lansing, Michigan

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 13, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/321203.321205 What is a DOI?

ABSTRACT

Tape sets and a tape set product are defined, and relationships are found between a table of products of tape sets and elements in the operation-preserving group of a finite automaton.

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	G. P. Weeg, The Structure of an Automaton and Its Operation-Preserving Transformation Group, Journal of the ACM (JACM), v.9 n.3, p.345-349, July 1962 [doi>10.1145/321127.321131]
	2	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]
	3	RABlN, M. O. AD SCOTW, D. Iinite automat and their decisiort prcblems. IBM J. Res. Develop. 3, 2 (Apr. 1959).