標(biāo)題: Titlebook: Automata, Languages, and Programming; 42nd International C Magnús M. Halldórsson,Kazuo Iwama,Bettina Speckman Conference proceedings 2015 S [打印本頁] 作者: ARGOT 時間: 2025-3-21 18:03
書目名稱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é)科排名
作者: Trypsin 時間: 2025-3-21 20:17
Analysis of Probabilistic Systems via Generating Functions and Padé Approximationnal resources. In particular, only a black-box, on-the-fly access to the transition function is presupposed, and the necessity of storing the whole model is eliminated. A few numerical experiments conducted with this technique give encouraging results.作者: Biofeedback 時間: 2025-3-22 03:17 作者: Deceit 時間: 2025-3-22 07:47
,Das Reinigen der ?le, Fette und Wachsarten,ully and faithfully complete at the type hierarchy built without .-types. Although definability for the hierarchy with .-types remains to be investigated, the notions of propositional equality in syntax and semantics do coincide for (open) terms of the .-free type hierarchy.作者: Indebted 時間: 2025-3-22 09:34 作者: Curmudgeon 時間: 2025-3-22 15:37 作者: deactivate 時間: 2025-3-22 20:58
Games for Dependent Typesully and faithfully complete at the type hierarchy built without .-types. Although definability for the hierarchy with .-types remains to be investigated, the notions of propositional equality in syntax and semantics do coincide for (open) terms of the .-free type hierarchy.作者: 熄滅 時間: 2025-3-22 23:43 作者: 留戀 時間: 2025-3-23 03:27 作者: beta-cells 時間: 2025-3-23 08:13
Elektrisch betriebene Wasserhaltungenharder for . ADTs. We effectuate this reduction for several of the most popular atomic objects. This reduction yields the first decidability results for verification without bounding the number of concurrent threads. Furthermore, it enables the application of existing safety-verification tools to linearizability verification.作者: 煞費苦心 時間: 2025-3-23 11:59 作者: 搖曳 時間: 2025-3-23 17:31 作者: Carminative 時間: 2025-3-23 19:44 作者: Monocle 時間: 2025-3-24 01:02 作者: 天空 時間: 2025-3-24 03:28
Edit Distance for Pushdown Automatan automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for deciding whether, for a given threshold ., the edit distance from a pushdown automaton to a finite automaton is at most ..作者: LAVA 時間: 2025-3-24 10:24
Reachability is in DynFOlternatively, .. and non-uniform . allow updates by uniform and non-uniform families of poly-size, bounded-depth circuits, respectively..The first result confirms a two decade old conjecture of Patnaik and Immerman [.]. The proofs rely mainly on elementary Linear Algebra. The second result can also be concluded from [.].作者: insipid 時間: 2025-3-24 14:00 作者: Ischemia 時間: 2025-3-24 16:44
Conference proceedings 2015. The papers are organized in the following three tracks: algorithms, complexity, and games; logic, semantics, automata and theory of programming; and foundations of networked computation: models, algorithms and information management.作者: elastic 時間: 2025-3-24 22:56 作者: indenture 時間: 2025-3-25 01:45 作者: 琺瑯 時間: 2025-3-25 03:36
Towards the Graph Minor Theorems for Directed Graphs full generality. As a consequence of our results we are able to improve results in Reed et al.?in 1996 [.] to disjoint cycles of length at least .. This would be the first but a significant step toward the structural goals for digraphs (hence towards the first point)..Concerning the second point, i作者: preeclampsia 時間: 2025-3-25 09:06
Provenance Circuits for Trees and Treelike Instancesperational details of query evaluation. We show applications of this provenance to capture existing counting and probabilistic results on trees and treelike instances, and give novel consequences for probability evaluation.作者: 沉著 時間: 2025-3-25 14:04 作者: 誰在削木頭 時間: 2025-3-25 17:40
The Complexity of Synthesis from Probabilistic Componentsve analysis problem, and to show that the more general quantitative problem is undecidable. For the qualitative analysis, we show that the problem (i)?is EXPTIME-complete when the specification is given as a deterministic parity word automaton, improving the previously known 2EXPTIME upper bound; an作者: 滴注 時間: 2025-3-25 21:40
Solution Sets for Equations over Free Groups are EDT0L Languagesesult became possible due to the recent recompression technique of Je?. In this paper we use a new method to integrate solutions of linear Diophantine equations into the process and obtain more general results than in the related paper [.]. For example, we improve the complexity from quadratic nonde作者: 仇恨 時間: 2025-3-26 00:16
Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching MDPs was not even known to be decidable..Our algorithms exploit the following basic fact: we show that for any BMDP, its maximum (minimum) .-reachability probabilities are given by the . (GFP) solution . of a corresponding monotone max (min) Probabilistic Polynomial System of equations (max/min-PPS)作者: Obstruction 時間: 2025-3-26 08:07 作者: Mettle 時間: 2025-3-26 09:15
https://doi.org/10.1007/978-3-322-81666-5 full generality. As a consequence of our results we are able to improve results in Reed et al.?in 1996 [.] to disjoint cycles of length at least .. This would be the first but a significant step toward the structural goals for digraphs (hence towards the first point)..Concerning the second point, i作者: Capture 時間: 2025-3-26 14:12 作者: Alienated 時間: 2025-3-26 17:49 作者: Commission 時間: 2025-3-26 23:42
https://doi.org/10.1007/978-3-642-47486-6ve analysis problem, and to show that the more general quantitative problem is undecidable. For the qualitative analysis, we show that the problem (i)?is EXPTIME-complete when the specification is given as a deterministic parity word automaton, improving the previously known 2EXPTIME upper bound; an作者: EVEN 時間: 2025-3-27 04:55
Einflüsse aus dem Wachstum der Familieesult became possible due to the recent recompression technique of Je?. In this paper we use a new method to integrate solutions of linear Diophantine equations into the process and obtain more general results than in the related paper [.]. For example, we improve the complexity from quadratic nonde作者: Keratectomy 時間: 2025-3-27 05:29 作者: ADOPT 時間: 2025-3-27 12:13 作者: LANCE 時間: 2025-3-27 15:39
Limited Set quantifiers over Countable Linear Orderingson cuts, weak monadic second-order logic, weak monadic second-order logic with cuts, as well as fragments of monadic second-order logic in which sets have to be well ordered or scattered. We give decidable algebraic characterizations of all these logics and compare their respective expressive power.作者: sulcus 時間: 2025-3-27 20:18 作者: CLEFT 時間: 2025-3-28 01:14
https://doi.org/10.1007/978-3-662-47666-6algorithms; automata; categorical semantics; computational complexity; constraint satisfaction; convex op作者: 假裝是你 時間: 2025-3-28 02:16
978-3-662-47665-9Springer-Verlag Berlin Heidelberg 2015作者: N斯巴達人 時間: 2025-3-28 08:05 作者: Blatant 時間: 2025-3-28 13:18
Rechnungswesen und Unternehmensüberwachungre difficult to get right, or to analyze with traditional verification techniques. This paper gives an introduction to distributed synthesis in the setting of Mazurkiewicz traces, and its applications to decentralized runtime monitoring.作者: Incorruptible 時間: 2025-3-28 16:51
Variabilit?t und Modalit?t der Ausschüttungon cuts, weak monadic second-order logic, weak monadic second-order logic with cuts, as well as fragments of monadic second-order logic in which sets have to be well ordered or scattered. We give decidable algebraic characterizations of all these logics and compare their respective expressive power.作者: Negotiate 時間: 2025-3-28 20:04
Einflüsse aus dem Wachstum der Familieogy. As we show, natural homology has many desirable properties: it is invariant under isomorphisms of directed spaces, it is invariant under refinement (subdivision), and it is computable on cubical complexes.作者: 無聊的人 時間: 2025-3-29 02:08 作者: 莊嚴(yán) 時間: 2025-3-29 06:43
Rechnungswesen und Unternehmensüberwachungre difficult to get right, or to analyze with traditional verification techniques. This paper gives an introduction to distributed synthesis in the setting of Mazurkiewicz traces, and its applications to decentralized runtime monitoring.作者: fallible 時間: 2025-3-29 09:23 作者: 粗語 時間: 2025-3-29 14:42
https://doi.org/10.1007/978-3-642-92017-2roofs. We present a new counting-based combinatorial proof of the Kneser-Lovász theorem that avoids the topological arguments of prior proofs for all but finitely many cases for each?.. We introduce a miniaturization of the octahedral Tucker lemma, called the .: it is open whether its propositional 作者: chisel 時間: 2025-3-29 17:33 作者: Yag-Capsulotomy 時間: 2025-3-29 20:08 作者: 幾何學(xué)家 時間: 2025-3-30 01:57
Die Wasserhaltungsanlagen mit Dampfbetriebefficients are certain hitting probabilities. Being able to compute such functions implies that the calculation of a number of quantities of interest, including absorption probabilities, expected hitting time and number of visits, and variances thereof, becomes straightforward. We show that it is of作者: 先鋒派 時間: 2025-3-30 07:03 作者: 在駕駛 時間: 2025-3-30 09:55
https://doi.org/10.1007/978-3-642-47486-6rom scratch” rather than composed from reusable components. However, this is rare in practice, and almost every non-trivial software system relies heavily on the use of libraries of reusable components. Recently, Lustig and Vardi introduced . and . synthesis from libraries of reusable components. Th作者: 調(diào)味品 時間: 2025-3-30 13:54 作者: Ibd810 時間: 2025-3-30 20:35 作者: 注視 時間: 2025-3-30 23:37
Variabilit?t und Modalit?t der Ausschüttungon cuts, weak monadic second-order logic, weak monadic second-order logic with cuts, as well as fragments of monadic second-order logic in which sets have to be well ordered or scattered. We give decidable algebraic characterizations of all these logics and compare their respective expressive power.作者: fabricate 時間: 2025-3-31 01:06 作者: 有組織 時間: 2025-3-31 05:31
Einflüsse aus dem Wachstum der Familieogy. As we show, natural homology has many desirable properties: it is invariant under isomorphisms of directed spaces, it is invariant under refinement (subdivision), and it is computable on cubical complexes.作者: 炸壞 時間: 2025-3-31 09:37 作者: 冥界三河 時間: 2025-3-31 17:21
Variabilit?t und Modalit?t der Ausschüttungce of a trade-off between the size of the memory and the bound achieved on the counters, which has been conjectured by Colcombet and L?ding. We show that unfortunately this conjecture does not hold: there is no trade-off between bounds and memory, even for finite arenas. On the positive side, we pro作者: photophobia 時間: 2025-3-31 21:27
Variabilit?t und Modalit?t der Ausschüttungo the unique input node that created it. In this way, the implementation of the transducer becomes part of its semantics. We show that the landscape of decidable properties changes drastically when origin info is added. For instance, equivalence of nondeterministic top-down and MSO transducers with
