標題: Titlebook: Automata, Languages and Programming; 17th International C Michael S. Paterson Conference proceedings 1990 Springer-Verlag Berlin Heidelberg [打印本頁] 作者: Traction 時間: 2025-3-21 17:30
書目名稱Automata, Languages and Programming影響因子(影響力)
書目名稱Automata, Languages and Programming影響因子(影響力)學(xué)科排名
書目名稱Automata, Languages and Programming網(wǎng)絡(luò)公開度
書目名稱Automata, Languages and Programming網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Automata, Languages and Programming被引頻次
書目名稱Automata, Languages and Programming被引頻次學(xué)科排名
書目名稱Automata, Languages and Programming年度引用
書目名稱Automata, Languages and Programming年度引用學(xué)科排名
書目名稱Automata, Languages and Programming讀者反饋
書目名稱Automata, Languages and Programming讀者反饋學(xué)科排名
作者: Feigned 時間: 2025-3-21 22:20 作者: 悲觀 時間: 2025-3-22 01:07
A complete and decidable proof system for call-by-value equalities,in a standard call-by-value model, settling an open question of [10]. By the full abstraction theorem of [20, 22], the logic proves all call-by-value observational congruences between pure terms. Finally, we show that the equations true in the standard model are decidable.作者: 火花 時間: 2025-3-22 07:32 作者: 寬大 時間: 2025-3-22 09:07
Two-way automata with multiplicity,m to this more general case. We in fact show that it holds in the case of automata with multiplicity in a commutative semiring, provided that an additional condition is satisfied. We prove that this condition is also necessary in a particular case. An application is given to zig-zag codes using spec作者: Defiance 時間: 2025-3-22 13:52 作者: 射手座 時間: 2025-3-22 19:21 作者: BADGE 時間: 2025-3-23 00:13
Functions as processes,s a recent step [15] towards a canonical treatment of concurrent processes. With quite simple encodings, two λ-calculus reduction strategies are simulated very closely; each reduction in λ-calculus is mimicked by a short sequence of reductions in π-calculus. Abramsky‘s precongruence of . [1] over λ-作者: 新手 時間: 2025-3-23 04:47
A domain-theoretic model for a higher-order process calculus,odel is constructed domain-theoretically and reflects a certain conceptual view-point about observability. It is not constructed from the syntax of the calculus or from computation sequences. We describe a new powerdomain construction that can be given additional algebraic structure that allows one 作者: parallelism 時間: 2025-3-23 07:45 作者: 支架 時間: 2025-3-23 10:34
Analytic variations on the common subexpression problem,nly once. Such a compaction can be effected in linear time. It is used to save storage in implementations of functional programming languages, as well as in symbolic manipulation and computer algebra systems. In compiling, the compaction problem is known as the “common subexpression problem” and it 作者: Licentious 時間: 2025-3-23 15:19
Can a maximum flow be computed in ,(,) time?,, this improves the previous best bound of .(..)..The bottleneck in our algorithm is a combinatorial problem on (unweighted) graphs. The number of operations executed on flow variables is .(..(log .).), in contrast with Ω(.) flow operations for all previous algorithms, where . denotes the number of 作者: THE 時間: 2025-3-23 20:58 作者: Critical 時間: 2025-3-24 02:03 作者: 遠足 時間: 2025-3-24 04:37 作者: 領(lǐng)巾 時間: 2025-3-24 07:25 作者: PIZZA 時間: 2025-3-24 11:46
Conference proceedings 1990ation for Theoretical Computer Science (EATCS). This annual conference series covers all important areas of theoretical computer science, such as computability, automata, formal languages, analysis of algorithms, computational complexity, data types and data structures, theory of data bases and know作者: hair-bulb 時間: 2025-3-24 15:54
https://doi.org/10.1007/978-90-313-6423-7an be given in constant length time intervals. Answers to queries given by the algorithm are always correct, the space bound is always satisfied, and the algorithm fails only with probability .(..), where . is the number of data items currently stored. The constant . can be chosen arbitrarily large.作者: Pericarditis 時間: 2025-3-24 22:11
Uri Weinblatt,Carmelit Avraham-Krehwinkelo be ., in the sense that it imposes as few restrictions as possible. This establishes the theoretical basis for a powerful and general type hierarchy with static type checking, which enables 1st order polymorphism combined with (multiple) inheritance and specialization in a language with assignments.作者: 兒童 時間: 2025-3-25 02:42
https://doi.org/10.1007/978-90-368-0949-8calculus is compared with that induced by the encoding of the lazy λ-calculus into π-calculus; a similar comparison is made for call-by-value λ-calculus..The part of π-calculus which is needed for the encoding is formulated in a new way, inspired by Berry‘s and Boudol‘s Chemical Abstract Machine [5].作者: Interlocking 時間: 2025-3-25 03:54
0302-9743 ean Association for Theoretical Computer Science (EATCS). This annual conference series covers all important areas of theoretical computer science, such as computability, automata, formal languages, analysis of algorithms, computational complexity, data types and data structures, theory of data base作者: 系列 時間: 2025-3-25 09:51 作者: minaret 時間: 2025-3-25 12:05
LEDA: A library of efficient data types and algorithms,rity queue, directed and undirected graph and partition are available. Based on these data types a variety of network algorithms (shortest paths, matchings, network flow, planarity testing and embedding, ...) and geometric algorithms (plane sweep, Voronoi digrams, ...) are included.作者: 箴言 時間: 2025-3-25 18:24 作者: choroid 時間: 2025-3-25 23:02 作者: Decibel 時間: 2025-3-26 00:51
Functions as processes,calculus is compared with that induced by the encoding of the lazy λ-calculus into π-calculus; a similar comparison is made for call-by-value λ-calculus..The part of π-calculus which is needed for the encoding is formulated in a new way, inspired by Berry‘s and Boudol‘s Chemical Abstract Machine [5].作者: EVEN 時間: 2025-3-26 06:00
Conference proceedings 1990ogical design and layout, parallel and distributed computation, theory of concurrency, symbolic and algebraic computation, term rewriting systems, computational geometry, cryptography, and theory of robotics. This volume contains five invited papers and 52 papers selected from 250 submitted.作者: 金盤是高原 時間: 2025-3-26 11:20 作者: choroid 時間: 2025-3-26 16:24 作者: tenuous 時間: 2025-3-26 16:56 作者: certain 時間: 2025-3-27 00:20 作者: Legion 時間: 2025-3-27 02:10
https://doi.org/10.1007/978-90-368-0949-8 the case in which all capacities are integers bounded by ., we show that a maximum flow can be computed using .(....+..(log .).) flow operations. Finally, we argue that several of our results yield optimal parallel algorithms.作者: 流逝 時間: 2025-3-27 08:35 作者: 千篇一律 時間: 2025-3-27 13:16 作者: 孤獨無助 時間: 2025-3-27 16:38 作者: languor 時間: 2025-3-27 21:32 作者: elucidate 時間: 2025-3-28 00:45 作者: Silent-Ischemia 時間: 2025-3-28 02:05 作者: 蘆筍 時間: 2025-3-28 07:13 作者: CODA 時間: 2025-3-28 13:41
Geweldloos verzet in de praktijk,reasing nondeterministically space constructible functions with sup.s(n)/log(n)=0. Consequently, the space constructibility cannot be used to separate nondeterministic space from deterministic one, since functions like loglog(n), and .are not space constructible by nondeterministic Turing machines.作者: 發(fā)起 時間: 2025-3-28 18:09
https://doi.org/10.1007/978-3-7091-5992-7geometry part is evolving. The main features of the library are.At present, the data types stack, queue, list, set, dictionary, ordered sequence, priority queue, directed and undirected graph and partition are available. Based on these data types a variety of network algorithms (shortest paths, matc作者: 不在灌木叢中 時間: 2025-3-28 21:30
https://doi.org/10.1007/978-90-313-6423-7tructed using sublinear time and space, and can be evaluated in constant time..These functions are used to construct a dynamic hashing scheme that performs in real time, i.e., a Monte Carlo type dictionary that uses linear space and needs worst case constant time per instruction. Thus instructions c作者: 舊石器時代 時間: 2025-3-29 02:24
Kinderen die de baas in huis worden,in a standard call-by-value model, settling an open question of [10]. By the full abstraction theorem of [20, 22], the logic proves all call-by-value observational congruences between pure terms. Finally, we show that the equations true in the standard model are decidable.作者: ANTE 時間: 2025-3-29 05:44
Uri Weinblatt,Carmelit Avraham-Krehwinkelloit this property to enable type-safe hierarchical procedures, it is necessary to impose a . on procedure calls. We introduce an example language and prove the existence of a . requirement which preserves static correctness while allowing hierarchical procedures. This requirement is further shown t作者: lobster 時間: 2025-3-29 10:12
https://doi.org/10.1007/978-90-313-6423-7m to this more general case. We in fact show that it holds in the case of automata with multiplicity in a commutative semiring, provided that an additional condition is satisfied. We prove that this condition is also necessary in a particular case. An application is given to zig-zag codes using spec作者: sperse 時間: 2025-3-29 15:00 作者: 空氣傳播 時間: 2025-3-29 16:29
Ouders en leerkrachten: samen sterk,st registers, each of them being of size .(.(.)). As a consequence such a RAM can also be simulated by a unit cost RAM in time .(.(.)+.(.)/.(.)) where .(.) denotes the number of input/output operations of a RAM to be simulated. In general the last simulation cannot be improved. Further the differenc作者: Euphonious 時間: 2025-3-29 21:40
https://doi.org/10.1007/978-90-368-0949-8s a recent step [15] towards a canonical treatment of concurrent processes. With quite simple encodings, two λ-calculus reduction strategies are simulated very closely; each reduction in λ-calculus is mimicked by a short sequence of reductions in π-calculus. Abramsky‘s precongruence of . [1] over λ-作者: 專橫 時間: 2025-3-30 03:50
Geweldloos verzet in de gemeenschap,odel is constructed domain-theoretically and reflects a certain conceptual view-point about observability. It is not constructed from the syntax of the calculus or from computation sequences. We describe a new powerdomain construction that can be given additional algebraic structure that allows one 作者: inundate 時間: 2025-3-30 07:51
Geweldloos verzet in de praktijk,endowed with a collection of symmetric binary relations which describe when two events at a particular state of . commute; we assume that these concurrency relations depend (in a natural way) locally on each other, but not globally. This model generalizes the recent concept of Stark‘s trace automata作者: 諄諄教誨 時間: 2025-3-30 10:37
https://doi.org/10.1007/978-90-368-0949-8nly once. Such a compaction can be effected in linear time. It is used to save storage in implementations of functional programming languages, as well as in symbolic manipulation and computer algebra systems. In compiling, the compaction problem is known as the “common subexpression problem” and it 作者: Anthem 時間: 2025-3-30 14:52
https://doi.org/10.1007/978-90-368-0949-8, this improves the previous best bound of .(..)..The bottleneck in our algorithm is a combinatorial problem on (unweighted) graphs. The number of operations executed on flow variables is .(..(log .).), in contrast with Ω(.) flow operations for all previous algorithms, where . denotes the number of 作者: 中子 時間: 2025-3-30 18:24 作者: Palpitation 時間: 2025-3-30 23:59
Two-way automata with multiplicity,m to this more general case. We in fact show that it holds in the case of automata with multiplicity in a commutative semiring, provided that an additional condition is satisfied. We prove that this condition is also necessary in a particular case. An application is given to zig-zag codes using special two-way automata.作者: Boycott 時間: 2025-3-31 04:20 作者: 盡管 時間: 2025-3-31 08:17 作者: 圣人 時間: 2025-3-31 13:16 作者: exorbitant 時間: 2025-3-31 17:00
Uri Weinblatt,Carmelit Avraham-KrehwinkelWe define a set ?. of lambda-terms for which we decide typing in system ...As the algorithm uses normalizability in an essential way, we also characterize normalizable terms in ?.. This allows us to connect the two properties and to build many non-typable terms, normalizable or not.作者: 未完成 時間: 2025-3-31 20:15 作者: 撫慰 時間: 2025-3-31 21:47
Generic terms having no polymorphic types,We define a set ?. of lambda-terms for which we decide typing in system ...As the algorithm uses normalizability in an essential way, we also characterize normalizable terms in ?.. This allows us to connect the two properties and to build many non-typable terms, normalizable or not.
