標題: Titlebook: Automata, Languages and Programming; 16th International C Giorgio Ausiello,Mariangiola Dezani-Ciancaglini,Si Conference proceedings 1989 Sp [打印本頁] 作者: Ensign 時間: 2025-3-21 18:04
書目名稱Automata, Languages and Programming影響因子(影響力)
書目名稱Automata, Languages and Programming影響因子(影響力)學科排名
書目名稱Automata, Languages and Programming網絡公開度
書目名稱Automata, Languages and Programming網絡公開度學科排名
書目名稱Automata, Languages and Programming被引頻次
書目名稱Automata, Languages and Programming被引頻次學科排名
書目名稱Automata, Languages and Programming年度引用
書目名稱Automata, Languages and Programming年度引用學科排名
書目名稱Automata, Languages and Programming讀者反饋
書目名稱Automata, Languages and Programming讀者反饋學科排名
作者: brassy 時間: 2025-3-21 20:37 作者: 尾巴 時間: 2025-3-22 04:11 作者: antedate 時間: 2025-3-22 08:28
Time lower bounds for CREW-PRAM computation of monotone functions,.), where . is the size of the largest prime implicant. It is also shown that the bound is existentially tight by constructing a family of monotone functions that can be computed in .=.(log .+(log .)/.), even by an EREW-PRAM. The same results hold if . is replaced by ., the size of the largest prime作者: RLS898 時間: 2025-3-22 10:36
Subduing self-application, the following shape: . Two methods are described to derive the combinator representing f by means of a generalized morphism, avoiding the use of fixed point combinators and preserving strong normalizability, i.e. the same feature warranted by most type disciplines..Can a given combinator s represen作者: 最后一個 時間: 2025-3-22 14:38 作者: 柱廊 時間: 2025-3-22 20:08
Polymorphic rewriting conserves algebraic strong normalization and confluence,dding the symbols of the algebraic signature to the polymorphic lambda calculus, as higher-order constants..We show that if a many-sorted algebraic rewrite system . is strongly normalizing (terminating, noetherian), then . + β + η + type-β + type-η rewriting of mixed terms is also strongly normalizi作者: 刺耳 時間: 2025-3-22 21:51 作者: Hypopnea 時間: 2025-3-23 01:51
About primitive recursive algorithms,uages [3,11]. One approach relies on representation theorems [3,8,10], which show that a large class of general recursive functions can be encoded in a language where general recursion is replaced by primitive recursion with functions, functionals,… as parameters [13]..These results are however pure作者: 特別容易碎 時間: 2025-3-23 05:50 作者: GEN 時間: 2025-3-23 12:26
Dominoes and the regularity of DNA splicing languages,noes. In the special case of alphabetic (symbol-to-symbol linked) dominoes the splicing semigroups are essentially equivalent to the splicing systems introduced by Head to study informational marcomolecules, specifically to study the effect of sets of restriction enzymes and ligase that allow DNA mo作者: 創(chuàng)新 時間: 2025-3-23 15:42 作者: 瑪瑙 時間: 2025-3-23 19:48
Infinite normal forms,In particular, we give algebraic semantics for theories described by such systems, consider sufficient completeness of hierarchical systems, suggest practical conditions for the existence of a limit and for its uniqueness, and extend the ideas to conditional rewriting.作者: 瘋狂 時間: 2025-3-24 00:02 作者: instate 時間: 2025-3-24 06:11 作者: carotid-bruit 時間: 2025-3-24 07:50 作者: confederacy 時間: 2025-3-24 11:47
Polymorphic rewriting conserves algebraic strong normalization and confluence,onical (complete) on algebraic terms, then . + β + type-β + type-η is canonical on mixed terms..η reduction does not commute with algebraic reduction, in general. However, using long η-normal forms, we show that if . is canonical then . + β + η + type-β + type-η convertibility is still decidable.作者: carotenoids 時間: 2025-3-24 15:39 作者: savage 時間: 2025-3-24 22:13 作者: Affiliation 時間: 2025-3-25 03:13 作者: mutineer 時間: 2025-3-25 04:07
Giorgio Ausiello,Mariangiola Dezani-Ciancaglini,Si作者: 肌肉 時間: 2025-3-25 10:19
0302-9743 data bases and knowledge based systems, cryptography, VLSI structures, parallel and distributed computing, models of concurrency and robotics.978-3-540-51371-1978-3-540-46201-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 興奮過度 時間: 2025-3-25 14:26
Further Research and Extensions], and [Li-87] do not suffice to construct such an oracle.) The construction is novel and the techniques may be useful in other settings..In addition, this paper also presents a number of new applications of the upward separation technique, including some new generalizations of the original result o作者: evasive 時間: 2025-3-25 17:17 作者: 言行自由 時間: 2025-3-25 21:37
https://doi.org/10.1007/978-1-4612-1774-9onical (complete) on algebraic terms, then . + β + type-β + type-η is canonical on mixed terms..η reduction does not commute with algebraic reduction, in general. However, using long η-normal forms, we show that if . is canonical then . + β + η + type-β + type-η convertibility is still decidable.作者: 充足 時間: 2025-3-26 02:11
Nilpotent Groups and Solvable Groups,system which is evaluated in call-by-name. In this setting, we give a non trivial necessary condition for an algorithm to be representable. As an application, we can show that the function . (which computes the minimum of two integers in unary representation) cannot be programmed in complexity .(.(.作者: CURT 時間: 2025-3-26 07:54
Conference proceedings 1989foundations of logic programming, theorem proving, software specification, computational geometry, data types and data structures, theory of data bases and knowledge based systems, cryptography, VLSI structures, parallel and distributed computing, models of concurrency and robotics.作者: EXALT 時間: 2025-3-26 10:23
Time lower bounds for CREW-PRAM computation of monotone functions, clause..An intermediate result of independent interest is that .(.), the size of the largest minimal vertex cover minimized over all (reduced) hypergraphs of . vertices and maximum hyperedge size ., satisfies the bounds Θ(..) ≤ .(.) ≤ .(..).作者: 增強 時間: 2025-3-26 16:14
Subduing self-application,t a successor of some adequate algebraic numeral system? Answers to this question are exemplified and assembled to solve the problem of embedding the infinite cyclic group ? of integers into a combinatory algebra.作者: 財政 時間: 2025-3-26 19:14
https://doi.org/10.1007/978-0-8176-8397-9 clause..An intermediate result of independent interest is that .(.), the size of the largest minimal vertex cover minimized over all (reduced) hypergraphs of . vertices and maximum hyperedge size ., satisfies the bounds Θ(..) ≤ .(.) ≤ .(..).作者: isotope 時間: 2025-3-26 23:03 作者: 飾帶 時間: 2025-3-27 01:36 作者: 觀點 時間: 2025-3-27 05:40 作者: 裁決 時間: 2025-3-27 11:35 作者: 推崇 時間: 2025-3-27 13:45 作者: dictator 時間: 2025-3-27 17:58
https://doi.org/10.1007/978-3-319-44394-2at our results are essentially optimal..We also examine the interrelationships among the levels of the low hierarchies and the classes of sets reducible to or equivalent to sparse and tally sets under different notions of reducibility. We feel that these results clarify the structure underlying the low hierarchies.作者: biopsy 時間: 2025-3-27 23:57
Jacob Kogan,Charles Nicholas,Marc Teboulle adapted very efficiently to run on bounded-degree networks, so that consensus can be reached in the presence of .(./log .) faulty processors in time .(.). It improves on the previous result, which implied that consensus can be reached in this setting in time Θ(..).作者: Spirometry 時間: 2025-3-28 05:22 作者: Innocence 時間: 2025-3-28 09:12
https://doi.org/10.1007/978-3-319-60516-6tion logic and show how this can be applied to the behavioral equational case, which leads to a behavioral approach to module specifications..In the third case we give a short overview of algebraic concepts in programming languages and discuss recent developments concerning concepts and efficiency of algebraic programming languages.作者: 熔巖 時間: 2025-3-28 10:37 作者: Loathe 時間: 2025-3-28 18:26
Asymptotically optimal distributed consensus, adapted very efficiently to run on bounded-degree networks, so that consensus can be reached in the presence of .(./log .) faulty processors in time .(.). It improves on the previous result, which implied that consensus can be reached in this setting in time Θ(..).作者: 令人作嘔 時間: 2025-3-28 22:23 作者: 蘆筍 時間: 2025-3-28 23:43
On recent trends in algebraic specification,tion logic and show how this can be applied to the behavioral equational case, which leads to a behavioral approach to module specifications..In the third case we give a short overview of algebraic concepts in programming languages and discuss recent developments concerning concepts and efficiency of algebraic programming languages.作者: 使高興 時間: 2025-3-29 03:11 作者: 必死 時間: 2025-3-29 08:07 作者: 打擊 時間: 2025-3-29 15:06
Efficient text searching of regular expressions,We present algorithms for efficient searching of regular expressions on preprocessed text. We obtain logarithmic (in the size of the text) average time for a wide subclass of regular expressions, and sublinear average time for any regular expression, hence providing the first known algorithm to achieve this time complexity.作者: Biguanides 時間: 2025-3-29 16:40
Completion of finite codes with finite deciphering delay,We show how to embed any finite code with finite deciphering delay in a rational maximal code with the same deciphering delay. This answers a question in [1].作者: HUMP 時間: 2025-3-29 22:54
Further Research and Extensionss some inherent limitations of the technique. The main result of this paper is the construction of an oracle relative to which there are extremely sparse sets in NP-P, but NEE = EE; this is in contradiction to a result claimed in [Ha-83, HIS-85]. Thus, although the upward separation technique is use作者: rectocele 時間: 2025-3-30 00:20
https://doi.org/10.1007/978-3-319-44394-2es of sets. However, until now, there has been no way of judging whether or not a given lowness result is the best possible..We prove absolute lower bounds on the location of classes is the extended low hierarchy, and relativized lower bounds on the location of classes in the low hierarchy in NP. In作者: Crater 時間: 2025-3-30 05:48 作者: Palter 時間: 2025-3-30 11:49 作者: enumaerate 時間: 2025-3-30 14:41 作者: 入會 時間: 2025-3-30 20:24 作者: Fantasy 時間: 2025-3-31 00:34 作者: Anticonvulsants 時間: 2025-3-31 04:03
https://doi.org/10.1007/978-1-349-12123-6is paper it is extended with recursive types, and the consistency of the resulting language is proved by constructing an interpretation of its types as . of a special kind, terms being interpreted as equivalence classes, modulo such relations, of elements of a model of the underlying language of unt作者: Cholecystokinin 時間: 2025-3-31 08:37
Nilpotent Groups and Solvable Groups,uages [3,11]. One approach relies on representation theorems [3,8,10], which show that a large class of general recursive functions can be encoded in a language where general recursion is replaced by primitive recursion with functions, functionals,… as parameters [13]..These results are however pure作者: 白楊魚 時間: 2025-3-31 13:09
Three-Dimensional Hyperbolic Space,orphism of two equational graphs is decidable. Equational graphs can be used to describe the behaviour of recursive applicative program schemes. We obtain a sufficient and decidable condition for the equivalence of these program schemes.作者: 運動性 時間: 2025-3-31 15:42
Groups Acting on Hyperbolic Spacenoes. In the special case of alphabetic (symbol-to-symbol linked) dominoes the splicing semigroups are essentially equivalent to the splicing systems introduced by Head to study informational marcomolecules, specifically to study the effect of sets of restriction enzymes and ligase that allow DNA mo作者: orient 時間: 2025-3-31 21:30 作者: 種族被根除 時間: 2025-4-1 00:18 作者: gospel 時間: 2025-4-1 04:30
https://doi.org/10.1007/978-3-319-60516-6n..In the first case, starting from the basic ideas of initial and final algebra semantics, we review some recent developments within the behavioral approach and present basic semantical constructions in the framework of an arbitrary specification logic..In the second case, starting with a short ove作者: 預知 時間: 2025-4-1 07:06 作者: 有斑點 時間: 2025-4-1 11:01
Automata, Languages and Programming978-3-540-46201-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: VEIL 時間: 2025-4-1 15:59
