標(biāo)題: Titlebook: Automata, Languages and Programming; Fifth Colloquium, Ud Giorgio Ausiello,Corrado B?hm Conference proceedings 1978 Springer-Verlag Berlin [打印本頁(yè)] 作者: Impacted 時(shí)間: 2025-3-21 19:01
書(shū)目名稱Automata, Languages and Programming影響因子(影響力)
書(shū)目名稱Automata, Languages and Programming影響因子(影響力)學(xué)科排名
書(shū)目名稱Automata, Languages and Programming網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Automata, Languages and Programming網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Automata, Languages and Programming被引頻次
書(shū)目名稱Automata, Languages and Programming被引頻次學(xué)科排名
書(shū)目名稱Automata, Languages and Programming年度引用
書(shū)目名稱Automata, Languages and Programming年度引用學(xué)科排名
書(shū)目名稱Automata, Languages and Programming讀者反饋
書(shū)目名稱Automata, Languages and Programming讀者反饋學(xué)科排名
作者: AVERT 時(shí)間: 2025-3-21 21:23
,Gewerbliche Ohrensch?digungen,on‘t have a pregiven set of control strings, but generate these during the course of derivations. The generative capacity for several models of rgs is studied. The control mechanism inherent to rgs establishes relationships between substrings in words. The nature of these relationships is investigat作者: 咯咯笑 時(shí)間: 2025-3-22 01:37
https://doi.org/10.1007/978-3-662-31580-4nition de cette notion (ambigu.té forte), nous la justifions et la confrontons à la notion classique. Nous prouvons sa consistance et nous mettons en évidence l‘existence de hiérarchies rationnelles, strictement croissantes, de langages fortement ambigus.作者: penance 時(shí)間: 2025-3-22 05:45 作者: 星球的光亮度 時(shí)間: 2025-3-22 12:19 作者: SLAY 時(shí)間: 2025-3-22 16:08
https://doi.org/10.1007/978-3-642-81702-1e variable is introduced as a machine-independent complexity measure for the effort of implementing scheduling schemes for mutual exclusion. Along the lines of a minimal solution for two-processor mutual exclusion using a three-valued message variable, a general n-processor solution is developed usi作者: 褲子 時(shí)間: 2025-3-22 17:25
,übersicht der wichtigen Gesetze,iffering from the lower bound by only a "lower order term." The problems of finding the k. largest element in a set in minimal and near minimal space are also discussed. A time space tradeoff is demonstrated for these problems.作者: 剝皮 時(shí)間: 2025-3-22 22:40 作者: 流逝 時(shí)間: 2025-3-23 03:22 作者: COWER 時(shí)間: 2025-3-23 05:46 作者: Fissure 時(shí)間: 2025-3-23 10:24 作者: 挖掘 時(shí)間: 2025-3-23 17:40
0302-9743 Overview: 978-3-540-08860-8978-3-540-35807-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 陶瓷 時(shí)間: 2025-3-23 21:15 作者: 以煙熏消毒 時(shí)間: 2025-3-24 01:07 作者: 媒介 時(shí)間: 2025-3-24 03:42
,übersicht der wichtigen Gesetze,iffering from the lower bound by only a "lower order term." The problems of finding the k. largest element in a set in minimal and near minimal space are also discussed. A time space tradeoff is demonstrated for these problems.作者: GUILT 時(shí)間: 2025-3-24 07:17 作者: Strength 時(shí)間: 2025-3-24 13:16
Arbeitnehmer-Erfindergesetz (ArbEG),The algebraic approach to specification and implementation of abstract data type in the sense of Goguen, Thatcher and Wagner is extended to study problems of stepwise specification and implementation. Two different concepts are introduced:.In both cases some basic results are given and applied to a practical example of software engineering.作者: Armada 時(shí)間: 2025-3-24 15:16
https://doi.org/10.1007/978-3-658-06128-9Non-containment for free single variable program schemes is shown to be NP-complete. A polynomial time algorithm for deciding equivalence of two free schemes, provided one of them has the predicates appearing in the same order in all executions, is given. However, the ordering of a free scheme is shown to lead to an exponential increase in size.作者: 絆住 時(shí)間: 2025-3-24 21:19
Voraussetzungen der PatenterteilungIt is shown how to modify the Boyer-Moore string matching algorithm so that its worst case running time is linear.作者: choroid 時(shí)間: 2025-3-25 02:12 作者: 沒(méi)有準(zhǔn)備 時(shí)間: 2025-3-25 05:17 作者: 個(gè)阿姨勾引你 時(shí)間: 2025-3-25 09:26 作者: 評(píng)論者 時(shí)間: 2025-3-25 14:18 作者: 腫塊 時(shí)間: 2025-3-25 18:46 作者: 貿(mào)易 時(shí)間: 2025-3-25 22:39 作者: 季雨 時(shí)間: 2025-3-26 04:00 作者: cringe 時(shí)間: 2025-3-26 06:34 作者: beta-cells 時(shí)間: 2025-3-26 08:42 作者: cavity 時(shí)間: 2025-3-26 13:44 作者: 異教徒 時(shí)間: 2025-3-26 17:14
On the power of self-application and higher type recursion,作者: OMIT 時(shí)間: 2025-3-26 21:57 作者: Charlatan 時(shí)間: 2025-3-27 05:04 作者: daredevil 時(shí)間: 2025-3-27 05:50
Ambiguite forte,nition de cette notion (ambigu.té forte), nous la justifions et la confrontons à la notion classique. Nous prouvons sa consistance et nous mettons en évidence l‘existence de hiérarchies rationnelles, strictement croissantes, de langages fortement ambigus.作者: 集聚成團(tuán) 時(shí)間: 2025-3-27 13:16
Relationship between density and deterministic complexity of MP-complete languages,this paper establishes that if CLIQUE has some f-sparse translation into another set, which is calculable by a deterministic Turing machine in time bounded by f, then all the sets belonging to NP are calculable in time bounded by a function polynomially related to f. The proof is constructive and sh作者: conquer 時(shí)間: 2025-3-27 16:55 作者: CAGE 時(shí)間: 2025-3-27 20:54
Mutual exclusion of N processors using an O(N)-valued message variable,e variable is introduced as a machine-independent complexity measure for the effort of implementing scheduling schemes for mutual exclusion. Along the lines of a minimal solution for two-processor mutual exclusion using a three-valued message variable, a general n-processor solution is developed usi作者: 臭了生氣 時(shí)間: 2025-3-27 23:48 作者: larder 時(shí)間: 2025-3-28 03:30
,Gewerbliche Ohrensch?digungen,unded by f, then all the sets belonging to NP are calculable in time bounded by a function polynomially related to f. The proof is constructive and shows the way of constructing a proper algorithm. The simplest and most significant corollary says that if there is an NP-complete language over a single letter alphabet, then P=NP.作者: etidronate 時(shí)間: 2025-3-28 08:46 作者: CUMB 時(shí)間: 2025-3-28 13:12
https://doi.org/10.1007/978-3-642-81702-1 lines of a minimal solution for two-processor mutual exclusion using a three-valued message variable, a general n-processor solution is developed using uninterruptable test-and-set instructions on a (2n-1)-valued message variable.作者: intimate 時(shí)間: 2025-3-28 16:24
Relationship between density and deterministic complexity of MP-complete languages,unded by f, then all the sets belonging to NP are calculable in time bounded by a function polynomially related to f. The proof is constructive and shows the way of constructing a proper algorithm. The simplest and most significant corollary says that if there is an NP-complete language over a single letter alphabet, then P=NP.作者: Fecal-Impaction 時(shí)間: 2025-3-28 22:25
,Stable models of typed λ-calculi,like sequential languages. We present new model constructions from a notion of stable function. This requires the introduction of two different orderings between stable functions which give very different cpo structures to the function spaces. We show that Milner‘s fully abstract model of Plotkin‘s PCP language only contains stable functions.作者: 水土 時(shí)間: 2025-3-29 00:57
Mutual exclusion of N processors using an O(N)-valued message variable, lines of a minimal solution for two-processor mutual exclusion using a three-valued message variable, a general n-processor solution is developed using uninterruptable test-and-set instructions on a (2n-1)-valued message variable.作者: Emg827 時(shí)間: 2025-3-29 05:56 作者: 思考 時(shí)間: 2025-3-29 08:04
,Gewerbliche Ohrensch?digungen,ed too. Applicability of rgs within both compiler theory and programming language description methods is demonstrated. New characterizations of a-transducer mappings and Turing-transductions are displayed. It is shown further how rgs can be used to formalize non-contextfree features in programming languages.作者: farewell 時(shí)間: 2025-3-29 12:32
第4樓作者: 憤怒歷史 時(shí)間: 2025-3-29 19:34
5樓作者: Minutes 時(shí)間: 2025-3-29 20:32
5樓作者: inferno 時(shí)間: 2025-3-30 01:23
5樓作者: apropos 時(shí)間: 2025-3-30 06:47
5樓作者: precede 時(shí)間: 2025-3-30 09:38
6樓作者: 時(shí)間等 時(shí)間: 2025-3-30 13:59
6樓作者: 不斷的變動(dòng) 時(shí)間: 2025-3-30 18:41
6樓作者: 悶熱 時(shí)間: 2025-3-30 22:40
6樓作者: 貧困 時(shí)間: 2025-3-31 02:33
7樓作者: 柔美流暢 時(shí)間: 2025-3-31 06:31
7樓作者: 貪婪性 時(shí)間: 2025-3-31 12:25
7樓作者: anniversary 時(shí)間: 2025-3-31 16:19
7樓作者: 故意釣到白楊 時(shí)間: 2025-3-31 19:33
8樓作者: archetype 時(shí)間: 2025-4-1 01:40
8樓作者: gout109 時(shí)間: 2025-4-1 04:24
8樓作者: 痛苦一下 時(shí)間: 2025-4-1 08:20
9樓作者: 郊外 時(shí)間: 2025-4-1 13:05
9樓作者: 種子 時(shí)間: 2025-4-1 18:14
9樓作者: hegemony 時(shí)間: 2025-4-1 22:08
9樓作者: 冒號(hào) 時(shí)間: 2025-4-1 23:19
10樓作者: Immunization 時(shí)間: 2025-4-2 05:38
10樓作者: somnambulism 時(shí)間: 2025-4-2 10:00
10樓作者: Airtight 時(shí)間: 2025-4-2 14:56
10樓
