Showing papers in "Journal of Computer and System Sciences in 1983"

TL;DR: An O(mn log n)-time algorithm is obtained to find a maximum flow in a network of n vertices and m edges, beating by a factor of log n the fastest algorithm previously known for sparse graphs.

TL;DR: In this paper, a divide-and-conquer framework for VLSI graph layout is introduced, which is used to design regular and configurable layouts, to assemble large networks of processor using restructurable chips, and to configure networks around faulty processors.

TL;DR: Conditions under which a subnet can be substituted for a single transition while preserving properties such as liveness and boundedness are presented.

TL;DR: This first paper discusses the interaction of group theory and formal language theory, and conjecture that a finitely generated group is context-free if the word problem is a context- free language for finitely generate presentations of G.

TL;DR: Protocols for implementing contract signing, confidential disclosures, and certified mail in an electronic mail system are proposed, which can be implemented with just a small probability of a participant cheating his partner, by use of a beacon emitting random integers.

TL;DR: A low and a high hierarchy within NP are defined, similar to the jump hierarchies below the degree of the halting problem, which is a complexity theoretic counterpart of the jump operator in recursion theory.

TL;DR: It is proved that self-reducible sets are not polynomial-time Turing reducible to these sets, and weakly p -selective sets are introduced as a generalization of p - selective sets based on this characterization.

TL;DR: In this article, the authors design and analyze an algorithm which realizes both asymptotic bounds simultaneously and makes possible a completely general implementation as a Fortran subroutine or even as a six-head finite automaton.

TL;DR: Criteria for surjectivity and injectivity of the global transition function of such a cellular automaton are presented and the question of reappearance of patterns for such cellular automata is also dealt with.

TL;DR: The results in this paper indicate that the borderline between decidable and undecidable propositional dynamic Logic (PDL) is extremely close to the original regular PDL, and the versions of PDL which are show to be beyond this borderline are shown to be actually very highly Undecidable.

TL;DR: In this paper, a class of ω-languages defined by structural properties instead of, as usually, by accepting devices is investigated, and it is shown that up to the level F σ ∪ G δ of the Borel hierarchy both classes coincide.

TL;DR: This work model a process—the unit of concurrent processing—as a port automaton, a certain type of nondeterministic sequential machine, and shows how to compute the response of these automata, and study the properties of their port interconnections.

TL;DR: It is shown that there exist algorithms for deciding whether or not an arbitrary regular language has a Ω-representation over an arbitrary class C of regular languages for any subset Ω of T.

TL;DR: It is shown that the edge-contraction problem PEC(π) is NP-hard if π is hereditary on contractions and is determined by the biconnected components, and even if the authors restrict ourselves to the class of planar graphs.

TL;DR: It is shown that for any reasonable generalization of chess to an NxN board, deciding for a given position which player has a winning strategy it is PSPACE-complete.

TL;DR: Nous montrons que tout generateur de Rocl est bifidele et qu'il existe un langage a un compteur qui domine tous les autres par transduction rationnelle preservant les longueurs.

TL;DR: In this paper contraction theories are defined and used as interpretations for Σ, a finite set of equations where the expressions ti denote terms built from individual variables, “ function constants,” and the “function variables” ϕ1,…,ϕn.

TL;DR: Algebras for iteration theories are introduced and it is shown that the absolutely free iteration alge bras are the algebra of regular trees.

TL;DR: A uniform lower bound on the firing time of embeddable solutions is derived, and optimal embeddables solutions are presented for several classes of networks, including rings, star graphs, flower graphs, and n -dimensional rectangular arrays.

TL;DR: It is shown first that there is no recursive function bounding the succinctness gained using parsable content-free grammars instead of parsers, and that there exists an infinite family of LL(2) Grammars such that the size of every left or right parser for these grammARS must be ⩾2cm.

TL;DR: An O( N 2 log 2 N)- area layout for the shuffle—exchange graph on a two-dimensional grid is described, the first which is known to achieve Thompson's asymptotic lower bound.

TL;DR: Reducible flowcharts as introduced by Hecht and Ullman have been algebraically characterized by Elgot and Shepherdson and the algebraic characterization is extended to the class of infinite almost accessible reducible flowchart.

TL;DR: How a natural mathematical formulation of the “solution” of a system of recursion equations is formally almost identical with well-known formulations of a solution of a systems of “iteration equations” is shown.

TL;DR: It is shown that k + 1 heads are better than k for one-way multihead pushdown (resp. stack) automata if they do not have endmarkers on the input tape and accept by final state with at least one input head at the right end of the input string.

TL;DR: A new characterization of acyclic join dependency, based on “structured edge-trees,” is given and is used to obtain a variety of results on acy Cleric join dependency and a modification of the Graham reduction process.

TL;DR: It is shown that in the arithmetical characterization of the class N P, called EEBA form, all but one of the bounded universal quantifiers can be eliminated and shows that EEBA sets do not form a hierarchy with respect to quantifier alternation.

TL;DR: A framework of definitions for, and questions about, notions of computability, complexity, and logic for term algebras is built around known results in the literature and the current work and how various particular results give further insight into such fundamental notions as Turing computable and recursively enumerable.

TL;DR: Generalizing the item method which is well known from LR ( k ) theory a decidable criterion and a parsing algorithm are obtained and it yields tests and inclusion theorems for the various classes of grammars considered.

TL;DR: It is shown that there exists a one-input automaton whose transformation semigroup has its order greater than any polynomial function of the number of states and that the index and the period of the transformation semitecture can be determined in time proportional to thenumber of states.

TL;DR: It is demonstrated that for graphs associated with the problems of oblivious merging and pattern matching, restricting the minimal space necessary to compute outputs implies that the graphs have nonoptimal size.