By Topic

Switching and Automata Theory, 1973. SWAT '08. IEEE Conference Record of 14th Annual Symposium on

Date 15-17 Oct. 1973

Filter Results

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

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

    Publication Year: 1973, Page(s):iv - v
    Request permission for commercial reuse | PDF file iconPDF (170 KB)
    Freely Available from IEEE
  • Foreword

    Publication Year: 1973, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (82 KB)
    Freely Available from IEEE
  • Linear pattern matching algorithms

    Publication Year: 1973, Page(s):1 - 11
    Cited by:  Papers (225)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1166 KB)

    In 1970, Knuth, Pratt, and Morris [1] showed how to do basic pattern matching in linear time. Related problems, such as those discussed in [4], have previously been solved by efficient but sub-optimal algorithms. In this paper, we introduce an interesting data structure called a bi-tree. A linear time algorithm for obtaining a compacted version of a bi-tree associated with a given string is presen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient algorithms for determining an extremal tree of a graph

    Publication Year: 1973, Page(s):12 - 15
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (337 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.
  • Efficient compilation of linear recursive programs

    Publication Year: 1973, Page(s):16 - 25
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1003 KB)

    A linear recursive program consists of a set of procedures where each procedure can make at most one recursive call. The conventional stack implementation of recursion requires time and space both proportional to n, the depth of recursion. It is shown that in order to implement linear recursion so as to execute in time n one does not need space proportional to n : ne for arbitrarily small e will d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Equivalence problems in monadic recursion schemes

    Publication Year: 1973, Page(s):26 - 33
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (837 KB)

    The inclusion problem for the class of monadic recursion schemes is shown to be undecidable, thus answering an open question of Paterson [5]. The proof depends upon a construction similar to one used showing that the question "is L1 ⊆ L2 ?" is undecidable for context-free languages L1, L2. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mechanizable proofs about parallel processes

    Publication Year: 1973, Page(s):34 - 48
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1479 KB)

    This paper attempts to use formal semantics of a class of parallel processes in order to carry out mechanizable proofs about them. The formalism used is LCF (Logic for Computable Functions, Milner [22]), with slight extensions. The processes we consider communicate by sharing memory, rather than by signals on communication lines. Parallelism is treated as nondeterminism. We state properties such a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Chow parameters in pseudothreshold logic

    Publication Year: 1973, Page(s):49 - 55
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (715 KB)

    The Investigation of Chow parameters is extended to pseudothreshold functions. Pseudothreshold logic is a generalization of threshold logic. Chow parameters are a set of n + 1 integers derived from a Boolean function of n variables. The main results are: 1. Two different pseudothreshold functions with the same Chow parameters have the same optimum structure. Thus, the optimum structures of pseudot... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On multiple-input change hazard-free combinational switching circuits without feedback

    Publication Year: 1973, Page(s):56 - 63
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    This paper deals with hazards on outputs of combinational circuits without feedback for multiple input changes. A procedure is given to decompose a Boolean function into a feedback free circuit. The procedure either gives a logic hazard-free circuit or shows that the Boolean function cannot be broken down into a feedback free circuit which is free of logic hazards for multiple input changes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple-input change asynchronous machines using controlled excitation and flip-flops

    Publication Year: 1973, Page(s):64 - 69
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (585 KB)

    A synthesis method for multiple-input change asynchronous sequential machines is proposed. The method is based on the self-synchronization principle. The internal states are realized with edge-sensitive flip-flops which are triggered selectively. The new concept of selective triggering or controlled excitation results in considerable saving in logic and more flexible design. The state assignment i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On lower bounds for computing the i-th largest element

    Publication Year: 1973, Page(s):70 - 81
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1153 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 finding and updating shortest paths and spanning trees

    Publication Year: 1973, Page(s):82 - 84
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (267 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.
  • Statistical indicators of optimality

    Publication Year: 1973, Page(s):85 - 91
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (443 KB)

    Neighborhood search has been used with some success in providing approximate solutions to discrete optimization problems. The technique produces solutions which may be locally but not globally optimal. For a particular class of problems this paper describes a method for analyzing the relative effectiveness associated with different neighborhoods in terms of the probability that a local optimum is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the optimal evaluation of a set of n-linear forms

    Publication Year: 1973, Page(s):92 - 102
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1385 KB)

    At the heart of a number of arithmetic complexity problems are some basic questions in tensor analysis. Questions regarding the complexity of multiplication operations which are n-linear are most easily studied in a tensor analytic framework. Certain results of tensor analysis are used in this paper to provide insight into the solution of some of these problems. Methods are given to determine a pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Characterizations of LR(O) languages

    Publication Year: 1973, Page(s):103 - 108
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (563 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 ability to cover LR(k) grammars with LR(1), SLR(1), and (1,1) bounded-context grammars

    Publication Year: 1973, Page(s):109 - 121
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1201 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.
  • Non-canonical parsing

    Publication Year: 1973, Page(s):122 - 129
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (895 KB)

    Although the field of "canonical parsing" (i.e. parsing in which we always reduce the leftmost phrase of a sentential form) has been extensively studied, the field of non-canonical parsing has been relatively untouched, In this paper, we first motivate the whole study by presenting a language which is intrinsically non-canonical and then we develop a general model of bottom-up parsing which incorp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Refinements of the nondeterministic time and space hierarchies

    Publication Year: 1973, Page(s):130 - 137
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (970 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 tape-bounded complexity classes and multi-head finite automata

    Publication Year: 1973, Page(s):138 - 144
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1092 KB)

    The principal result described in this paper is the equivalence of the following statements: (1) Every set accepted by a nondeterministic one-way two-head finite automaton can be accepted by a deterministic two-way k-head finite automaton, for some k. (2) The context-free language LPΣ (described in the paper) is recognized by a (log n)-tape bounded deterministic Turing machine. (3) Every se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complexity of recognition in intermediate Level languages

    Publication Year: 1973, Page(s):145 - 158
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1227 KB)

    Complexity of sentence recognition is studied for one-way stack languages, indexed languages, and tree transducer languages. The problem is shown to be polynomial-complete in each case. A class of naturallanguage grammars is formalized and the sentence-recognition problem is shown to be polynomial-hard although the languages are context-sensitive. The proofs give new language-theoretic characteriz... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic theorem-proving and the decision problem

    Publication Year: 1973, Page(s):159 - 166
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (933 KB)

    This paper investigates the possibilities of the resolution method of J.A. Robinson [12] as a decision procedure for classes of first-order formulas. It is shown here that resolution, a machine-oriented inference procedure, can be modified to be a method which decides whether certain kinds of quantificational formulas are satisfiable or unsatisfiable. A new complete resolution technique is present... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Graph-grammars: An algebraic approach

    Publication Year: 1973, Page(s):167 - 180
    Cited by:  Papers (45)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1625 KB)

    The paper presents an algebraic theory of graph-grammars using homomorphisms and pushout-constructions to specify embeddings and direct derivations constructively. We consider the case of arbitrary directed graphs permitting loops and parallel edges. The gluing of two arbitrary labeled graphs (push-out) is defined allowing a strictly symmetric definition of direct derivations and the embedding of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A notion of helping and pseudo-complementation in lattices of honest subrecursive classes

    Publication Year: 1973, Page(s):181 - 189
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (867 KB)

    A notion of one computable function (not) helping the computation of another is defined in terms of the lattices of honest subrecursive classes. It is said that two honest computable functions do not help each other's computation if the intersection (meet) of the subrecursive classes which they generate is the zero subrecursive class; that is, two functions do not help each other's computation if ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the size of sets of computable functions

    Publication Year: 1973, Page(s):190 - 196
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (713 KB)

    We investigate the size of sets of computable functions using category-theoretic methods (in the sense of the Baire Category theorem). Constructive definitions of no-where dense and meagre set are given and applied to several problems. In particular we apply it to subrecursive degree structures and to a comparison of the power of deterministic and nondeterministic time bounded oracle machines. View full abstract»

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