Titlebook: Sequences; Combinatorics, Compr Renato M. Capocelli Conference proceedings 1990 Springer-Verlag New York Inc. 1990 Approximation.Graph.Matc

存在主义

公理

Context-Dependent String Matching k differences are allowed between P and each of its occurrences in T. Various types of differences have been studied in the literature. We introduce here the concept of context-dependent errors, where the differences between P and T depend on errors in T that are functions of the context of P and/o

Ingenuity

Stable-Angina

动机

On optimal parallel computations for sequences of bracketsansforming sequences of brackets to trees on the parallel access machine without read and write conflicts (EREW PRAM). It gives also an optimal parallel transformation on EREW PRAM of texts of expressions and expression-trees. Previously an optimal parallel for this problem was known [2] on a strong

锯齿状

Universal sequences and graph cover times A short surveyds of an edge are not necessarily equal, that is, each edge is labeled twice. A sequence σ in {1,…, .}* is said to . . from . if, by starting from . and following the sequence of edge labels σ, one covers all the vertices of .. Let . . be a collection of .-regular graphs. A sequence σ is called . fo

出汗

无聊点好

贝雷帽

Sequences of Lyndon Wordsion in any message. The set of Lyndon words of length n, Λ., is the set obtained by choosing those strings which are lexicographically least in the primitive equivalence classes determined by cyclic permutation. We give an elementary proof that Λ. is a maximal code with bounded synchronization delay

overrule