Referenced Items are not available for this document.
Finite automata are considered in this paper as instruments for classifying finite tapes. Each one-tape automaton defines a set of tapes, a two-tape automaton defines a set of pairs of tapes, et cetera. The structure of the defined sets is studied. Various generalizations of the notion of an automaton are introduced and their relation to the classical automata is determined. Some decision problems concerning automata are shown to be solvable by effective algorithms; others turn out to be unsolvable by algorithms.
Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.
Published in:
IBM Journal of Research and Development
(Volume:3
,
Issue:
2
)
Date of Publication: April 1959
- Page(s):
- 114 - 125
- ISSN :
- 0018-8646
- Digital Object Identifier :
- 10.1147/rd.32.0114
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 April 2010
- Issue Date :
- April 1959
- Sponsored by :
- IBM
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
