標(biāo)題: Titlebook: Mathematical Foundations of Computer Science 2014; 39th International S Erzsébet Csuhaj-Varjú,Martin Dietzfelbinger,Zoltán Conference proce [打印本頁(yè)] 作者: Recovery 時(shí)間: 2025-3-21 19:08
書(shū)目名稱Mathematical Foundations of Computer Science 2014影響因子(影響力)
書(shū)目名稱Mathematical Foundations of Computer Science 2014影響因子(影響力)學(xué)科排名
書(shū)目名稱Mathematical Foundations of Computer Science 2014網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Mathematical Foundations of Computer Science 2014網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Mathematical Foundations of Computer Science 2014被引頻次
書(shū)目名稱Mathematical Foundations of Computer Science 2014被引頻次學(xué)科排名
書(shū)目名稱Mathematical Foundations of Computer Science 2014年度引用
書(shū)目名稱Mathematical Foundations of Computer Science 2014年度引用學(xué)科排名
書(shū)目名稱Mathematical Foundations of Computer Science 2014讀者反饋
書(shū)目名稱Mathematical Foundations of Computer Science 2014讀者反饋學(xué)科排名
作者: FOLD 時(shí)間: 2025-3-21 20:48
Marcello M. Bersani,Matteo Rossi,Pierluigi San Pietro作者: gonioscopy 時(shí)間: 2025-3-22 02:42
Arturo Carpi,Gabriele Fici,?těpán Holub,Jakub Opr?al,Marinella Sciortino作者: 碳水化合物 時(shí)間: 2025-3-22 07:29 作者: 粗魯性質(zhì) 時(shí)間: 2025-3-22 12:47
Julien Cassaigne,Gabriele Fici,Marinella Sciortino,Luca Q. Zamboni作者: ARM 時(shí)間: 2025-3-22 14:01
Partial-Observation Stochastic Reachability and Parity Gamesctions invisible), or (c)?they may use full randomization. We consider all these classes of games with reachability, and parity objectives that can express all .-regular objectives. The analysis problems are classified into the . analysis that asks for the existence of a strategy that ensures the ob作者: Nomadic 時(shí)間: 2025-3-22 20:55
What Does the Local Structure of a Planar Graph Tell Us About Its Global Structure?ea of Property Testing that leads to the following result (stated informally): There is a .?=?.(.,.) such that for any planar graph . its local structure (described by the frequency vector of .-disks) determines . up to insertion and deletion of at most .. edges (and relabelling of vertices).作者: 悶熱 時(shí)間: 2025-3-22 21:56
Towards Efficient Reasoning Under Guarded-Based Disjunctive Existential Ruleser the main guarded-based classes of disjunctive existential rules..We show that (unions of) conjunctive queries of bounded hypertree-width and of bounded treewidth do not reduce the complexity of our problem, even if we focus on predicates of bounded arity, or on fixed sets of disjunctive existenti作者: dissolution 時(shí)間: 2025-3-23 02:42 作者: 睨視 時(shí)間: 2025-3-23 08:39 作者: 葡萄糖 時(shí)間: 2025-3-23 13:06
Christian SohlerPSS-Routine FACTOR:. Sie führt eine Hauptkomponenten-Faktorenanalyse mit Varimax-Rotation durch, die aus den zw?lf Variablen zw?lf Faktoren extrahiert und berechnet für jeden Datensatz die Faktorwerte, also die x. bis x.-Werte.. Um sicher zu gehen, da? es sich auch bei den Faktorwerten um zuf?llige 作者: 使聲音降低 時(shí)間: 2025-3-23 17:01 作者: excursion 時(shí)間: 2025-3-23 19:45
Namit Chaturvedi,Marcus Gelderie wie bei dem Bedeutungsthema notwendig, eigene Kategorien zu entwickeln, die unsere Analyse erm?glichen sollen. Wir ben?tigen also einen tragf?higen Lernbegriff. Diesen beschaffen wir uns, gem?? unserem bisherigen Vorgehen, aus einer historischen Analyse. Der Grund für ein solches Vorgehen ist die A作者: elucidate 時(shí)間: 2025-3-23 22:32
Yijia Chen,Moritz Müller wie bei dem Bedeutungsthema notwendig, eigene Kategorien zu entwickeln, die unsere Analyse erm?glichen sollen. Wir ben?tigen also einen tragf?higen Lernbegriff. Diesen beschaffen wir uns, gem?? unserem bisherigen Vorgehen, aus einer historischen Analyse. Der Grund für ein solches Vorgehen ist die A作者: 怒目而視 時(shí)間: 2025-3-24 03:23 作者: Customary 時(shí)間: 2025-3-24 09:49
Thomas Colcombet,Laure Daviaud,Florian Zulegertellung dieser bereits statistisch ausgewerteten Ergebnisse der Simulationsstudie im vorliegenden Kapitel erfolgt zuerst die Pr?sentation der LISREL-Ergebnisse und dann die der Ergebnisse der Neuronalen Netze. Im Anschlu? daran werden die beiden Methodiken vergleichend gegenübergestellt. Jeder diese作者: 和平主義 時(shí)間: 2025-3-24 12:08 作者: 祝賀 時(shí)間: 2025-3-24 16:30 作者: Biguanides 時(shí)間: 2025-3-24 20:26 作者: cringe 時(shí)間: 2025-3-24 23:40 作者: NEG 時(shí)間: 2025-3-25 03:55
Sofic-Dyck Shiftsifts is a particular class of shifts of sequences whose finite factors are unambiguous context-free languages. We show that it corresponds exactly to shifts of sequences whose set of factors is a visibly pushdown language. We give an expression of the zeta function of a sofic-Dyck shift which has a deterministic presentation.作者: ambivalence 時(shí)間: 2025-3-25 10:25
Alternating Parity Krivine Automatagic is decidable over finite structures. We present an automaton model that captures the semantics of HFL. This automaton model combines alternating parity automata with the lookup mechanisms from the Krivine machine.作者: 行乞 時(shí)間: 2025-3-25 12:23 作者: fulcrum 時(shí)間: 2025-3-25 16:49 作者: gerrymander 時(shí)間: 2025-3-25 23:22 作者: 性上癮 時(shí)間: 2025-3-26 01:23 作者: 修正案 時(shí)間: 2025-3-26 05:34 作者: 單純 時(shí)間: 2025-3-26 08:46 作者: 可耕種 時(shí)間: 2025-3-26 15:03
Subword Complexity and Decomposition of the Set of Factorse that the class . coincides with the class of infinite words of linear complexity. On the other hand, although the class . is included in the class of words of complexity .(..), this inclusion is strict for .?>?2.作者: 針葉樹(shù) 時(shí)間: 2025-3-26 17:54
Conference proceedings 2014tions of Computer Science, MFCS 2014, held in Budapest, Hungary, in August 2014. The 95 revised full papers presented together with 6 invited talks were carefully selected from 270 submissions. The focus of the conference was on following topics: Logic, Semantics, Automata, Theory of Programming, Al作者: LAIR 時(shí)間: 2025-3-26 22:09
0302-9743 cal Foundations of Computer Science, MFCS 2014, held in Budapest, Hungary, in August 2014. The 95 revised full papers presented together with 6 invited talks were carefully selected from 270 submissions. The focus of the conference was on following topics: Logic, Semantics, Automata, Theory of Progr作者: accessory 時(shí)間: 2025-3-27 02:03 作者: 發(fā)微光 時(shí)間: 2025-3-27 06:14
Universal Lyndon Wordsticular prefix codes, which we call Hamiltonian lex-codes, and show that every Hamiltonian lex-code is in bijection with the set of the shortest unrepeated prefixes of the conjugates of a universal Lyndon word. This allows us to give an algorithm for constructing all the universal Lyndon words.作者: incisive 時(shí)間: 2025-3-27 12:38
Classifying Recognizable Infinitary Trace Languages Using Word Automatas of all recognizable .-trace languages in terms of Muller (word) automata. Finally, we show that the linearization of any recognizable .-trace language can be expressed as a Boolean combination of languages recognized by our class of deterministic Büchi automata.作者: Soliloquy 時(shí)間: 2025-3-27 17:28 作者: 無(wú)關(guān)緊要 時(shí)間: 2025-3-27 21:00
0302-9743 amming, Algorithms, Complexity, Parallel and Distributed Computing, Quantum Computing, Automata, Grammars and Formal Languages, Combinatorics on Words, Trees and Games.978-3-662-44521-1978-3-662-44522-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Unsaturated-Fat 時(shí)間: 2025-3-28 00:27
Random Deterministic Automataost recent advances, such as the average running time of Moore’s state minimization algorithm or the estimation of the probability that an automaton is minimal. While focusing on results, we also try to give an idea of the main tools used in this field.作者: Preserve 時(shí)間: 2025-3-28 03:18 作者: defendant 時(shí)間: 2025-3-28 10:18
An Algebraic Characterization of Unary Two-Way Transducersar case where the input and output alphabets are both unary but when the transducer is not necessarily deterministic. This yields a family which extends properly the rational relations in a very natural manner. We show that deterministic two-way unary transducers are no more powerful than one-way transducers.作者: 大看臺(tái) 時(shí)間: 2025-3-28 13:17 作者: 離開(kāi)就切除 時(shí)間: 2025-3-28 15:58 作者: 六邊形 時(shí)間: 2025-3-28 21:10
Partial-Observation Stochastic Reachability and Parity Gameslassified as follows: (a)?general partial-observation (both players have partial view of the game); (b)?one-sided partial-observation (one player has partial-observation and the other player has complete-observation); and (c)??perfect-observation (both players have complete view of the game). The on作者: 書(shū)法 時(shí)間: 2025-3-29 02:48 作者: 缺乏 時(shí)間: 2025-3-29 06:59
Communication Complexity Theory: Thirty-Five Years of Set Disjointnesstive is to determine with minimal communication whether the . subsets have nonempty intersection. The important special case .?=?2 corresponds to two parties trying to determine whether their respective sets intersect. The study of the set disjointness problem spans almost four decades and offers a 作者: 否認(rèn) 時(shí)間: 2025-3-29 10:41 作者: 拋射物 時(shí)間: 2025-3-29 14:19 作者: chastise 時(shí)間: 2025-3-29 17:20
Sofic-Dyck Shiftsifts is a particular class of shifts of sequences whose finite factors are unambiguous context-free languages. We show that it corresponds exactly to shifts of sequences whose set of factors is a visibly pushdown language. We give an expression of the zeta function of a sofic-Dyck shift which has a 作者: PURG 時(shí)間: 2025-3-29 20:21 作者: 滔滔不絕地說(shuō) 時(shí)間: 2025-3-30 00:28
Asymptotic Monadic Second-Order Logicbject of study is Asymptotic Monadic Second-Order Logic over infinite words. This is a logic talking about .-words labelled by integers. It contains full monadic second-order logic and can express asymptotic properties of integers labellings..We also introduce several variants of this logic and inve作者: 粉筆 時(shí)間: 2025-3-30 05:50
Towards Efficient Reasoning Under Guarded-Based Disjunctive Existential Rulesles has been recently settled. It has been shown that the problem is very hard, namely 2.-complete, even for fixed sets of rules expressed in lightweight formalisms. This gives rise to the question whether its complexity can be reduced by restricting the query language. Several subclasses of conjunc作者: 先鋒派 時(shí)間: 2025-3-30 09:57 作者: septicemia 時(shí)間: 2025-3-30 12:56 作者: 跳動(dòng) 時(shí)間: 2025-3-30 16:45 作者: URN 時(shí)間: 2025-3-30 22:10
Subword Complexity and Decomposition of the Set of Factorslanguage belongs to the class . if it is a subset of the catenation of . languages ..???.., where the number of words of length . in each of .. is bounded by a constant. The class of infinite words whose set of factors is in . is denoted by .. In this paper we focus on the relations between the clas作者: 輕推 時(shí)間: 2025-3-31 01:58 作者: Vaginismus 時(shí)間: 2025-3-31 07:29 作者: 種類 時(shí)間: 2025-3-31 10:17 作者: Mumble 時(shí)間: 2025-3-31 13:54 作者: humectant 時(shí)間: 2025-3-31 17:46
Alternating Vector Addition Systems with Statesing for infinite-arena games played over a VASS. Initially introduced in the study of propositional linear logic, they have more recently gathered attention in the guise of . games for quantitative verification and synthesis..We show that establishing who is the winner in such a game with a state re作者: 輕率看法 時(shí)間: 2025-3-31 22:16
