By Topic

11th Annual Symposium on Switching and Automata Theory (swat 1970)

28-30 Oct. 1970

Filter Results

Displaying Results 1 - 25 of 28
  • [Front cover]

    Publication Year: 1970, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (23 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 1970, Page(s):4 - 5
    Request permission for commercial reuse | PDF file iconPDF (115 KB)
    Freely Available from IEEE
  • Foreword

    Publication Year: 1970, Page(s): 3
    Request permission for commercial reuse | PDF file iconPDF (44 KB)
    Freely Available from IEEE
  • Program schemata as automata

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

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Equivalence of programs with structured variables

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

    We consider a class of straight line programs admitting structured variables. It is easy to associate with each program a set of expressions which reflects the natural meaning of a structured variable such as an array. However, the question of whether two such expressions are equivalent depends on what is assumed about the possible initial values of the variables and what algebraic laws are assume... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On maximally parallel schemata

    Publication Year: 1970, Page(s):32 - 50
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1941 KB)

    A model for parallel computation called a schema is presented. This model is similar to that presented in the recent work of Karp and Miller2. Section 1 presents a description of the model, and some results on the characterization of computations within it. Section 2 summarizes some results on determinacy and equivalence. Section 3 presents a formalization of the property of maximal parallelism in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A phenomenon in the theory of sorting

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

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the efficiency of programs in subrecursive formalisms

    Publication Year: 1970, Page(s):60 - 67
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (833 KB)

    We study the effect of program structure on computational efficiency in a class of abstract languages which model actual high-level numerical programming languages (like ALGOL). The results have bearing on programming technique (the use of go to statements), and they yield interesting facts about Blum's speed-up theorem for subrecursive computational complexity. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the optimality of some set and vector algorithms

    Publication Year: 1970, Page(s):68 - 71
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (523 KB)

    Optimality, to within a multiplicative constant, is shown for some algorithms dealing with vectors and finite sets. Among the problems discussed are: Is vector x equal to vector y ? Given two finite sets A and B, is A = B ? Is A ⊆ B ? Is A ∩ B = φ ? What is |A ∩ B| ? What is |A - B| ? Is A - B = φ ? View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the computational power of some machines with pushdown-like storage

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

    The computational power of 2-way pushdown automata with m additional counters (called mC-PDA) is investigated. It is shown that any multi-tape Turingmachine (with a two-way input tape) which accepts within time T(n), where n is the input length, can be simulated by a 3C-PDA whose counters are bounded by T(n) and that any such Turing machine can also be simulated by a 2C-PDA whose counters are boun... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tape-bounds for time-bounded Turing machines

    Publication Year: 1970, Page(s):73 - 75
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (233 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On star-free events

    Publication Year: 1970, Page(s):76 - 80
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (589 KB)

    It is an open problem, suggested by Papert and McNaughton, to find a decision procedure for determining whether a regular event is locally testable. In this paper we provide a partial solution, giving two effectively decidable conditions, one necessary and one sufficient, for local testability. Our proofs are for the most part algebraic, using machine decompositions and semigroup theory. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deux applications de la representation matricielle d'une serle rationnelle non commutative

    Publication Year: 1970, Page(s):81 - 87
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (795 KB)

    La représentation matricielle minimale attachée à une série rationnelle en variables non commutatives permet de généraliser à ces séries des résultats connus en théorie des langages. Les méthodes employées permettent aussi d'étudier les parties rationnelles de certains monoïdes comme le groupe libre. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault detection experiments for asynchronous sequential machines

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

    A new flow table for describing normal-fundamental-mode (NFM) asynchronous machines, the ADSE table, is introduced. Although the structure of this table has several ramifications in the area of circuit realization, this paper emphasizes its utility in generating checking experiments for NFM asynchronous machines. Using the ADSE table, a procedure is presented that allows existing (or future) metho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synchronizing and representation problems for sequential machines with masked outputs

    Publication Year: 1970, Page(s):97 - 103
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (969 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Elimination of static and dynamic hazards in combinational switching circuits

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

    This paper deals with hazards on out-puts of combinational switching circuits for multiple input changes. Certain types of function hazards are defined and are shown to be impossible to eliminate with any logic realization. Also, an interrelation between static and dynamic function hazards is established. Hazards due to delays in the logic are defined and a method of elimination is given for both ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asynchronous sequential circuits with (2, 1) type state assignments

    Publication Year: 1970, Page(s):109 - 113
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (354 KB)

    The simultaneous use of delayed and undelayed versions of the internal variables permits the realization of normal fundamental mode circuits with less restricted state assignments than the usual single transition time state assignments. This paper is concerned with problems associated with these state assignments. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asynchronous sequential switching circuits with unrestricted input changes

    Publication Year: 1970, Page(s):114 - 121
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (810 KB)

    The problem of designing asynchronous circuits where the changes in binary input signals occur independently of one another is discussed. If several input changes occur within some interval δ1, the circuit behaves as though the changes were simultaneous. If consecutive changes are spaced by intervals exceeding some longer interval δ2 then the circuit reacts as though a sequence of si... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The synthesis of finite state syntax directed top-down and bottom-up transducers

    Publication Year: 1970, Page(s):122 - 132
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1101 KB)

    The notion of context-free LR(K) and LL(K) grammars and of the related bottom-up and top-down syntax-directed parsings are well known [1,2,3]. In this report we present a number of synthesis algorithms which take a non-self-embedding, sequential, context-free grammar and produce the finite state transducer which either top-down or bottom-up parses sentences in the language induced by the grammar i... View full abstract»

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

    Publication Year: 1970, Page(s):133 - 138
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (589 KB)

    Syntactic clues are aids to parsing. The amount of nondeterminism in parsers for pairs of homomorphically related semithue language systems is compared. If the parsers are without lookahead, the domain language system parser has no more nondeterminism than the codomain language system parser. The domain language system has at least as many clues. If the parsers have lookahead and the homomorphism ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deterministic left corner parsing

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

    Left corner parsing refers to a class of parsing procedures in which the productions are recognized in a particular order which is different than both bottom up and top down. Each production is recognized after its left descendant but before its other descendants. Procedures in this class have occurred frequently in the compiler literature. In this paper a class of grammars, called LC (k) grammars... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parsing algorithms with backtrack

    Publication Year: 1970, Page(s):153 - 174
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2243 KB)

    Two classes of restricted top down parsing algorithms using backtrack are considered. We show that the smaller class recognizes all deterministic context free languages, and that both classes can be simulated in linear time on a random access machine. Certain generalizations of these parsing algorithms are shown equivalent to the larger class. Finally, some decision and closure properties of the c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extended precedence languages, bounded right context languages, anti deterministic languages

    Publication Year: 1970, Page(s):175 - 180
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (533 KB)

    First Page of the Article
    View full abstract»

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

    Publication Year: 1970, Page(s):181 - 193
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1539 KB)

    First Page of the Article
    View full abstract»

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

    Publication Year: 1970, Page(s):194 - 215
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1465 KB)

    Complex behavior by machines can be achieved by either having a large number of very simple machines or by having a complex machine with which to start. Our primary interest in this paper was with the former. By considering the global behavior of a large number of the simplest of machines, the following results were shown: 1. An array of identical square cells each of which can exist in only four ... View full abstract»

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