TL;DR: A constructive definition of partial derivatives is given, their properties are studied, and they are employed to develop a new algorithm for turning regular expressions into relatively small NFA and to provide certain improvements to Brzozowski's algorithm constructing DFA.

TL;DR: Both algorithms are generalized and lead to new linear strategies for Union-Find that are neither covered by the algorithm of Gabow and Tarjan (1984) nor by the one of Dillencourt et al. (1992).

TL;DR: Universal Turing machines are proved to exist in the following classes: UTM (24,2), UTM(10,3), U TM(7,4), UTR(5,5), USM(4,6), UTSM (3,10) and U TM (2,18).

TL;DR: It is shown that many of the semantics proposed for logic programs with negation can be expressed in terms of notions emerging from graph theory, establishing in this way a link between the fields.

TL;DR: The proof uses a special coding function for finite sequences of positive integers and some strong classical results concerning distribution of primes to construct several small universal register machines.

TL;DR: Under the hypothesis that NP does not have p-measure 0 (roughly, that NP contains more than a negligible subset of exponential time), it is shown that there is a language that is ≤ T P -complete (“Cook complete”), but not ≤ m P - complete (’Karp-Levin complete’), for NP.

TL;DR: A step towards a classification of models for concurrency based on the parameters above is moved, and a representative of any of the eight classes of models obtained by varying the three parameters is chosen using the language of category theory.

TL;DR: This new model of computing, splicing systems, is investigated, and with a few exceptions, the author is able to obtain precise characterizations for all resulting families.

TL;DR: The basic axioms, definitions and concepts of net theory are reviewed, and new concepts and results presented, among them security constructions, compilation of nets, measurement and modelling of continuous variables, and a law on the limits of precision in observation, measurement, control and realistic modelling.

TL;DR: This paper establishes a formal setting to study secret sharing schemes in which the dealer has the feature of being able to activate a particular access structure out of a given set and/or to allow the participants to reconstruct different secrets by sending to all participants the same broadcast message.

TL;DR: In this paper, several notions for confluence in processes and how these relate to τ-inertness are provided. But these notions can conveniently be used to simplify the structure of processes while preserving equivalence.

TL;DR: In this paper, a solution method for recursive domain equations that combines and extends the standard order-theoretic (Smyth and Plotkin, 1982) and metric (America and Rutten, 1989) approaches is presented.

TL;DR: It is shown that the calculus lacks strong completeness, so selection functions to cut down the search space are not applicable, and it is established an interesting connection between itsStrong completeness and the completeness of basic narrowing.

TL;DR: This paper considers arbitrary behavioural equalities determined by (partial) congruence relations and shows how to reduce the behavioural theory of any class of algebras to (a subset of) the standard theory of some corresponding class ofAlgebra.

TL;DR: The one-dimensional firing squad synchronization problem (FSSP) is to construct a generic automaton of a one dimensional cellular network made of a segment of n identical machines so that, at some time (the firing time t(n), all automata enter simultaneously and for the very first time the firing state F.

TL;DR: This paper addresses the study of noninterleaving semantics in the framework of process algebras for mobile systems, like π-calculus, with a focus on location bisimulation (⁈ /), in this opinion one of the most convincing non-Interleaving equivalences, which aims to describe the spatial dependencies on processes.

TL;DR: These are simple concrete descriptions of the free algebras in the varieties generated by the “shuffle semirings” of theFree monoid Σ∗.

TL;DR: In this paper, a polynomial approximation theory linked to combinatorial optimization is defined and a notion of equivalence among optimization problems is introduced, which includes translation or affine transformation of the objective function or yet some aspects of equivalencies between maximization and minimization problems.

TL;DR: The first half is a tutorial on orderings, lattices, Boolean algebras, operators on BooleanAlgebra, Tarski's fixed point theorem, and relation algeBRas, and elements of a complete relation algebra are used as “meanings” for program statements.

TL;DR: In this article, the authors explicite les frequences des facteurs de la suite de Fibonacci en utilisant le graphe des mots, and generalize this result to suites sturmiennes en montrant.

TL;DR: It is proved that this class of recursive relations essentially coincides with the authors' class of densely computable relations, defined via Turing machines, and in the special case of the real numbers coincides with the classical class of computable real-valued functions.

TL;DR: A quadratic algorithm is proposed to compute an optimal schedule for a class of series-parallel graphs, called SP1 graphs, which includes in particular in- Forests and out-forests.

TL;DR: A substantial part of the analytical branch of the structure theory of free choice systems, including decomposition and duality, the rank theorem, characterisations of impartial sequences and prompt interfaces, and the existence of home states are extended to the equal conflict case.

TL;DR: Several notions for confluence in processes are provided and it is shown how these relate to τ-inertness, i.e. if then s and s′ are equivalent, and how these can conveniently be used to reduce the size of state spaces and simplify the structure of processes while preserving equivalence.

TL;DR: It is shown that in any finite field F q a primitive root can be found in time O(q 1 4 + e ) .

TL;DR: This paper presents and analyses efficient implementations of a so-called direct process on distributed memory machines (DMMs) that yields an implementation of a static dictionary on an n-processor arbitrary DMM with parallel access time of O(log*n).

TL;DR: Upper and lower bounds on total variation distance to stationarity are derived for the distribution of search cost under the move-to-front (MTF) rule for self-organizing lists with i.i.d. record requests to obtain sharp rates of convergence for several standard examples of weights, including Zipf's law and geometric weights, as the length of the list becomes large.

TL;DR: The use of categorical relationships between models for concurrency, allowing the translation of concepts and properties from one model to another, is illustrated by transferring to Petri nets a general concept of bisimulation.

TL;DR: The connection of this problem with the density form of the Hales-Jewett theorem in Ramsey theory is pointed out, which allows us to show that the error probability converges to 0 as n → ∞.