negligence 发表于 2025-3-26 21:20:33
http://reply.papertrans.cn/87/8604/860337/860337_31.pngNEXUS 发表于 2025-3-27 02:11:06
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正面 发表于 2025-3-27 06:43:07
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 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. ThisInstinctive 发表于 2025-3-27 12:51:10
http://reply.papertrans.cn/87/8604/860337/860337_34.png名义上 发表于 2025-3-27 15:31:50
http://reply.papertrans.cn/87/8604/860337/860337_35.png调整 发表于 2025-3-27 18:48:07
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通情达理 发表于 2025-3-27 22:24:34
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返老还童 发表于 2025-3-28 02:36:22
http://reply.papertrans.cn/87/8604/860337/860337_38.pngEmasculate 发表于 2025-3-28 07:15:30
http://reply.papertrans.cn/87/8604/860337/860337_39.png自由职业者 发表于 2025-3-28 13:35:33
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