Scheduled Maintenance on March 25th, 2017:
Single article purchases and IEEE account management will be unavailable from 4:00 AM until 6:30 PM (ET). We apologize for the inconvenience.
By Topic

IEEE Transactions on Computers

Issue 7 • July 1970

Filter Results

Displaying Results 1 - 24 of 24
  • IEEE Transactions on Computers - Table of contents

    Publication Year: 1970, Page(s):c1 - 678
    Request permission for commercial reuse | PDF file iconPDF (558 KB)
    Freely Available from IEEE
  • IEEE Computer Group

    Publication Year: 1970, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (181 KB)
    Freely Available from IEEE
  • An Algorithm for Detecting Unimodal Fuzzy Sets and Its Application as a Clustering Technique

    Publication Year: 1970, Page(s):583 - 593
    Cited by:  Papers (62)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3089 KB)

    An algorithm is presented which partitions a given sample from a multimodal fuzzy set into unimodal fuzzy sets. It is proven that if certain assumptions are satisfied, then the algorithm will derive the optimal partition in the sense of maximum separation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interactive Pattern Analysis and Classification

    Publication Year: 1970, Page(s):594 - 616
    Cited by:  Papers (40)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (12539 KB)

    This paper describes an on-line interactive graphics system which has been designed to solve the problems of pattern analysis and pattern classification. A wide variety of both classical and unique mathematical algorithms, along with their graphic system implementation, are discussed. A discussion of an application of the system to the handprinted character recognition problem is included. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the State Minimization of Nondeterministic Finite Automata

    Publication Year: 1970, Page(s):617 - 627
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2473 KB)

    The aim of this paper is to obtain a procedure for finding a minimum state nondeterministic finite automaton (NDA) equivalent to a given (in general, nondeterministic) finite automaton. Given a finite automaton A, we derive from A a matrix of 1' s and 0's, called a reduced automaton matrix RAM) of A, in a certain way and show that each state of A corresponds to a grid over the RAM. A grid consists... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Transform Approach to Logic Design

    Publication Year: 1970, Page(s):627 - 640
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3536 KB)

    This paper describes a new approach to the design of combinational logic using large-scale integrated (LSI) circuit technology. A simple "prototype" logic function of n binary variables is imbedded within an array of at most (n+1) rows and columns. The cells of this array contain two-input EXCLUSIVE-OR gates, and its rows are fed by the input variables and logical "1." Its column outputs are first... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • State Assignment Selection in Asynchronous Sequential Circuits

    Publication Year: 1970, Page(s):641 - 644
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (869 KB)

    Methods already exist for the construction of critical race-free assignments for asynchronous sequential circuits. Some of these methods permit the construction of many assignments for the same flow table. The algorithm presented here consists of two easy to apply tests which select that critical race-free assignment most likely to produce a set of simple next-state equations. The algorithm has be... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Identification of Totally Symmetric Boolean Functions

    Publication Year: 1970, Page(s):645 - 648
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (939 KB)

    This paper shows how a "unity-ratio" totally sym-metric function can be identified without any further decomposition. The identification is carried out by writing the given function in its ordered partitioned tabular form. The method is general, straightforward, and programmable on a digital computer. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pattern Classification Using Stochastic Approximation Techniques

    Publication Year: 1970, Page(s):649 - 651
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    A nonparametric training procedure capable of processing an arbitrary sequence of patterns based on stochastic approximation techniques is considered. An acceleration scheme based on the adaptive Robbins-Monro procedure to increase the rate of convergence and to make the estimation asymptotically efficient is proposed. This scheme has been applied to the problem of recognition of handwritten chara... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Cyclic Algebra for the Synthesis of Ternary Digital Systems

    Publication Year: 1970, Page(s):651 - 653
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    The original multivalued algebra defined by Post in 1921 [1] included the cyclization operation in its generating set. Up to now the algebra has not been used for the synthesis of ternary digital systems because of two shortcomings: no simple canonical forms are possible, and the cyclization is difficult to implement. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comment on "Gray Code Counter"

    Publication Year: 1970, Page(s):653 - 654
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB)

    The Gray code counter is stated to be an accidental result of the logical design of a binary counter which has two memory elements per stage. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Authors' Reply3

    Publication Year: 1970, Page(s): 654
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (90 KB)

    To seek the origins of Gray codes is to peer farther into the past than 1947. As mentioned in our note, the structure of our counter was suggested by the "Chinese rings" puzzle; the codes themselves can describe solutions to the "Tower of Hanoi" puzzle (see our [4]). More recent uses of the unitdistance principle may also be found.4 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Contributors

    Publication Year: 1970, Page(s): 655
    Request permission for commercial reuse | PDF file iconPDF (1298 KB)
    Freely Available from IEEE
  • B70-2 Transmission of Information by Orthogonal Functions

    Publication Year: 1970, Page(s): 656
    Request permission for commercial reuse | PDF file iconPDF (248 KB)
    Freely Available from IEEE
  • R70-17 Asynchronous Sequential Circuits with Feedback

    Publication Year: 1970, Page(s): 657
    Cited by:  Papers (1)
    Request permission for commercial reuse | PDF file iconPDF (296 KB)
    Freely Available from IEEE
  • R70-18 Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines

    Publication Year: 1970, Page(s):657 - 658
    Request permission for commercial reuse | PDF file iconPDF (608 KB)
    Freely Available from IEEE
  • R70-19 Frequency of Decomposability Among Machines with a Large Number of States

    Publication Year: 1970, Page(s): 658
    Request permission for commercial reuse | PDF file iconPDF (344 KB)
    Freely Available from IEEE
  • R70-20 Sequential Boolean Equations

    Publication Year: 1970, Page(s): 658
    Request permission for commercial reuse | PDF file iconPDF (344 KB)
    Freely Available from IEEE
  • R70-21 Time and Tape Complexity of Pushdown Automaton Languages

    Publication Year: 1970, Page(s):658 - 659
    Cited by:  Papers (1)
    Request permission for commercial reuse | PDF file iconPDF (664 KB)
    Freely Available from IEEE
  • R70-22 Subdirect Decompositions of Transformation Graphs

    Publication Year: 1970, Page(s): 659
    Request permission for commercial reuse | PDF file iconPDF (352 KB)
    Freely Available from IEEE
  • R70-23 Multi-Tape and Multi-Head Pushdown Automata

    Publication Year: 1970, Page(s):659 - 660
    Request permission for commercial reuse | PDF file iconPDF (592 KB)
    Freely Available from IEEE
  • R70-24 A Procedure for Selecting Diagnostic Tests

    Publication Year: 1970, Page(s): 660
    Request permission for commercial reuse | PDF file iconPDF (264 KB)
    Freely Available from IEEE
  • Abstracts of Current Computer Literature

    Publication Year: 1970, Page(s):661 - 678
    Request permission for commercial reuse | PDF file iconPDF (5696 KB)
    Freely Available from IEEE
  • Information for authors

    Publication Year: 1970, Page(s): 678
    Request permission for commercial reuse | PDF file iconPDF (337 KB)
    Freely Available from IEEE

Aims & Scope

The IEEE Transactions on Computers is a monthly publication with a wide distribution to researchers, developers, technical managers, and educators in the computer field.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Paolo Montuschi
Politecnico di Torino
Dipartimento di Automatica e Informatica
Corso Duca degli Abruzzi 24 
10129 Torino - Italy
e-mail: pmo@computer.org