Titlebook: STACS 90; 7th Annual Symposium Christian Choffrut,Thomas Lengauer Conference proceedings 1990 Springer-Verlag Berlin Heidelberg 1990 Comput

negligence

NEXUS

The ring of ,-regular sequences,udied by Christol, Kamae, Mendès France and Rauzy, and other writers. Since the range of an automatic sequence is finite, however, their descriptive power is severely limited..In this paper, we generalize the concept of automatic sequence to the case where the sequence can take its values in a (poss

正面

Hiding instances in multioracle queries,mial-time machine A wants to query an oracle B for . to obtain ., without telling B exactly what . is. It is shown in [1] that, if . is an NP-hard function, A cannot query a single oracle B while hiding all but the size of the instance, assuming that the polynomial hierarchy does not collapse. This

Instinctive

名义上

调整

Towards a process semantics in the logic programming style,ich is parametric with respect to the observation function. The semantics is given in a logic programming style, i.e. with three different although equivalent characterizations (operational, model-theoretic and fixpoint). This semantics should fill the gap between the classic HCL semantics (not info

通情达理

Parallel computations on strings and arrays,ys and for related problem: longest common subarray, longest repeated subarray and longest symmetric subarray. We also give almost optimal algorithms for problems on strings: finding squares, testing even palstars, computing Lyndon factorizations and building pattern matching automata. In the PRAM m

返老还童

Emasculate

自由职业者

Relation-sorted algebraic specifications with built-in coercers: Basic notions and results,C consists of a signature, a set of equations and an arbitrary relation ⊳ on the set of sorts. But our notion of SPEC-algebras is more general. In particular, if two sorts are in the sort relation s⊳s′, then we assume that, in each SPEC-algebra A, the corresponding carriers A. and A., are related by