標題: Titlebook: Automata, Languages and Programming; 25th International C Kim G. Larsen,Sven Skyum,Glynn Winskel Conference proceedings 1998 Springer-Verla [打印本頁] 作者: palliative 時間: 2025-3-21 17:19
書目名稱Automata, Languages and Programming影響因子(影響力)
書目名稱Automata, Languages and Programming影響因子(影響力)學科排名
書目名稱Automata, Languages and Programming網(wǎng)絡公開度
書目名稱Automata, Languages and Programming網(wǎng)絡公開度學科排名
書目名稱Automata, Languages and Programming被引頻次
書目名稱Automata, Languages and Programming被引頻次學科排名
書目名稱Automata, Languages and Programming年度引用
書目名稱Automata, Languages and Programming年度引用學科排名
書目名稱Automata, Languages and Programming讀者反饋
書目名稱Automata, Languages and Programming讀者反饋學科排名
作者: 永久 時間: 2025-3-21 22:13 作者: 撤退 時間: 2025-3-22 03:15 作者: glucagon 時間: 2025-3-22 05:32
Simple linear-time algorithms for minimal fixed points,l checking. Our algorithms run in linear-time, matching the complexity of the best existing algorithms for similar problems, and are simple to understand. The main novelty of our global algorithm is that it does not use the counter and “reverse list” data structures commonly found in existing linear作者: 關(guān)心 時間: 2025-3-22 10:55
,Hardness results for dynamic problems by extensions of Fredman and Saks’ chronogram method,ies or the right answer ±1 as an oracle. We prove that for the dynamic partial sum problem, these new powers do not help, the problem retains its lower bound of Ω(log ./log log .)..From these results we easily derive a large number of lower bounds of order Ω(log ./log log .) for conventional dynamic作者: DEFER 時間: 2025-3-22 16:26 作者: 狗窩 時間: 2025-3-22 21:04
Partial-congruence factorization of bisimilarity induced by open maps,one in the setting of a concrete category supporting algebraic constructions of subobject and quotient. Some sufficient condition is found for bisimilarity to be factorizable by the greatest .. We also find a necessary and sufficient condition for a factorization of bisimilarity: quotients by all ma作者: 個人長篇演說 時間: 2025-3-23 01:14
Reset nets between decidability and undecidability,ility is undecidable in all these extensions (indeed they are Turing-powerful), we exhibit unexpected frontiers for the decidability of Termination, Coverability, Boundedness and place-Boundedness. In particular, we show counter-intuitive separations between seemingly related problems. Our main theo作者: Aqueous-Humor 時間: 2025-3-23 05:07 作者: Encephalitis 時間: 2025-3-23 08:42
,Difficult configurations — on the complexity of ,,in a global state, also called configuration. The logic is shown to be non-elementary with the main reason for this complexity being the nesting of until operators in formulas. The fragment of the logic without the until operator is shown to be EXPSPACE-complete.作者: Flatter 時間: 2025-3-23 11:11 作者: thalamus 時間: 2025-3-23 15:04 作者: MORPH 時間: 2025-3-23 20:32
Independent sets with domination constraints,ning vertices (. υ ? .: |. ∩ .| ? ..) For all values of ., we classify as either .-complete or polynomial-time solvable the problems of deciding if a given graph has a .-independent set. We complement this with approximation algorithms and inapproximability results, for all the corresponding optimiz作者: 事物的方面 時間: 2025-3-24 00:58 作者: 表否定 時間: 2025-3-24 03:31
Deciding bisimulation-like equivalences with finite-state processes, this method to the class of PAD processes, which strictly subsumes PA and push-down (PDA) processes, showing that a large class of bisimulation-like equivalences (including e.g. strong and weak bisimilarity) is decidable between PAD and finite-state processes. On the other hand, we also demonstrate作者: Campaign 時間: 2025-3-24 06:47 作者: 自傳 時間: 2025-3-24 14:01
Deciding global partial-order properties,so sharpen previous undecidability results, which used global predicates over configurations. We show that although our logic allows only local propositions (over events), it becomes undecidable when adding some natural . operator.作者: cocoon 時間: 2025-3-24 16:40
Simple linear-time algorithms for minimal fixed points,point evaluation in dependency graphs. This establishes dependency graphs as a suitable framework in which to express and compute alternation-free fixed points..Finally, we relate HORNSAT, the problem of Horn formula satisfiability, to the problem of minimal fixed-point evaluation in dependency grap作者: Mhc-Molecule 時間: 2025-3-24 22:35
On the expressiveness of real and integer arithmetic automata,at tests the value of a specified digit of a number. Furthermore, in the course of proving that sets of vectors defined in this theory are recognizable by finite automata, we show that linear equations and inequations have surprisingly compact representations by automata, which leads us to believe t作者: 無政府主義者 時間: 2025-3-25 00:19 作者: PAEAN 時間: 2025-3-25 05:26
Nutzentheoretische Lebensqualit?tsmessungso sharpen previous undecidability results, which used global predicates over configurations. We show that although our logic allows only local propositions (over events), it becomes undecidable when adding some natural . operator.作者: 哥哥噴涌而出 時間: 2025-3-25 08:58 作者: Crohns-disease 時間: 2025-3-25 14:09
O. Sch?ffski,S. Sohn,M. Bierbaumat tests the value of a specified digit of a number. Furthermore, in the course of proving that sets of vectors defined in this theory are recognizable by finite automata, we show that linear equations and inequations have surprisingly compact representations by automata, which leads us to believe t作者: AROMA 時間: 2025-3-25 18:40
Do probabilistic algorithms outperform deterministic ones?,作者: 全國性 時間: 2025-3-25 22:43
https://doi.org/10.1007/978-3-642-56366-9is achieved, and if additionally w/log . ≥ (log log .). for some fixed ε > 0, the query time is constant. For both of these special cases, the best previous upper bound was O(log log .). A new lower bound is also observed.作者: 圓錐體 時間: 2025-3-26 03:04
Gesundheits?konomische Evaluationen.(. log .) time using .(.) space an eliminating edge for each elimination step. We thus obtain the first non-trivial algorithm that computes for . a sequence of . ? 3 edge translations reducing . to a triangle.作者: 心胸狹窄 時間: 2025-3-26 05:57
https://doi.org/10.1007/978-3-658-14326-8ation problems..These approximation results extend also to several related independence problems. In particular, we obtain a √. approximation of the Set Packing problem, where . is the number of base elements, as well as a √. approximation of the maximum independent set in power graphs .., for . even.作者: jet-lag 時間: 2025-3-26 09:10 作者: 輕信 時間: 2025-3-26 13:40 作者: 博識 時間: 2025-3-26 17:06
Reducing simple polygons to triangles - A proof for an improved conjecture -,.(. log .) time using .(.) space an eliminating edge for each elimination step. We thus obtain the first non-trivial algorithm that computes for . a sequence of . ? 3 edge translations reducing . to a triangle.作者: dura-mater 時間: 2025-3-26 21:19 作者: 值得尊敬 時間: 2025-3-27 02:14
Deciding bisimulation-like equivalences with finite-state processes, that no ‘reasonable’ bisimulation-like equivalence is decidable between state-extended PA processes and finite-state ones. Furthermore, weak bisimilarity with finite-state processes is shown to be undecidable even for state-extended BPP (which are also known as ‘parallel pushdown processes’).作者: 預定 時間: 2025-3-27 07:47 作者: dermatomyositis 時間: 2025-3-27 10:26
0302-9743 ta and temporal logic, algorithms, infinite state systems, semantics, approximation, thorem proving, formal languages, pi-calculus, automata and BSP, rewriting, networking and routing, zero-knowledge, quantum computing, etc..978-3-540-64781-2978-3-540-68681-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: deceive 時間: 2025-3-27 17:15 作者: 前奏曲 時間: 2025-3-27 19:22
https://doi.org/10.1007/978-3-662-11871-9int location, incremental parsing, fundamental data structure problems like maintaining the majority of the prefixes of a string of bits and range queries. We characterise the complexity of maintaining the value of any symmetric function on the prefixes of a bit string.作者: 顛簸下上 時間: 2025-3-27 23:50 作者: 地牢 時間: 2025-3-28 05:10 作者: gorgeous 時間: 2025-3-28 09:03 作者: AXIS 時間: 2025-3-28 11:39 作者: 貿(mào)易 時間: 2025-3-28 17:28
Nutzentheoretische Lebensqualit?tsmessungarity to be factorizable by the greatest .. We also find a necessary and sufficient condition for a factorization of bisimilarity: quotients by all maximal open congruences are isomorphic. The general results are motivated and illustrated by important examples: transition systems, event structures and presheaves.作者: 松雞 時間: 2025-3-28 21:47
Gesundheits?konomische Evaluationenoverability, Boundedness and place-Boundedness. In particular, we show counter-intuitive separations between seemingly related problems. Our main theorem is the very surprising fact that boundedness is undecidable for Petri nets with Reset arcs.作者: 分離 時間: 2025-3-29 00:22 作者: exercise 時間: 2025-3-29 05:00 作者: 脫毛 時間: 2025-3-29 09:50
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/166199.jpg作者: 赤字 時間: 2025-3-29 12:14
Gesundheits?konomische EvaluationenLet . be a finite monoid: define C.(.) to be the maximum number of bits that need to be exchanged in the .-party communication game to decide membership in any language recognized by . We prove the following:.We also show that when . is in ., C.(.) = O(1) for some . and conjecture that this algebraic condition is also necessary.作者: 情感脆弱 時間: 2025-3-29 17:31
U. Siebert,N. Mühlberger,O. Sch?ffskiWe consider the problem of coding planar graphs by binary strings. Depending on whether .(1)-time queries for adjacency and degree are supported, we present three sets of coding schemes which all take linear time for encoding and decoding. The encoding lengths are significantly shorter than the previously known results in each case.作者: 無法治愈 時間: 2025-3-29 21:22
An algebraic approach to communication complexity,Let . be a finite monoid: define C.(.) to be the maximum number of bits that need to be exchanged in the .-party communication game to decide membership in any language recognized by . We prove the following:.We also show that when . is in ., C.(.) = O(1) for some . and conjecture that this algebraic condition is also necessary.作者: aspect 時間: 2025-3-30 02:30 作者: facetious 時間: 2025-3-30 04:04 作者: 使高興 時間: 2025-3-30 08:19
,Difficult configurations — on the complexity of ,,in a global state, also called configuration. The logic is shown to be non-elementary with the main reason for this complexity being the nesting of until operators in formulas. The fragment of the logic without the until operator is shown to be EXPSPACE-complete.作者: RUPT 時間: 2025-3-30 15:40
Distributed matroid basis completion via elimination upcast and distributed correction of minimum-w reduce the amount of work necessary for the upcast by relying on the special properties of matroids. As an application, it is shown that the algorithm can be used for correcting a minimum weight spanning tree computed for a .-diameter network, after . edges have changed their weight, in time ..作者: Ischemia 時間: 2025-3-30 20:19 作者: 寡頭政治 時間: 2025-3-30 23:09 作者: falsehood 時間: 2025-3-31 03:47 作者: Graphite 時間: 2025-3-31 07:10 作者: gratify 時間: 2025-3-31 11:56
https://doi.org/10.1007/BFb0055035Algorithms; Concurrency; Mathematical Logic; Networking; Processing; Text; programming; robot; data structur作者: conception 時間: 2025-3-31 17:25 作者: CT-angiography 時間: 2025-3-31 19:35
Gesundheits?konomische Evaluationenreactive systems, taking full fairness into consideration. We use the computational model of a . (.) which takes into account both . (weak fairness) and . (strong fairness). The approach presented here reduces the model checking problem into the question of whether a given FKS is . (i.e. has at leas作者: Audiometry 時間: 2025-3-31 23:47
