標(biāo)題: Titlebook: Mathematical Foundations of Computer Science 2015; 40th International S Giuseppe F Italiano,Giovanni Pighizzini,Donald T. Conference proce [打印本頁(yè)] 作者: misperceive 時(shí)間: 2025-3-21 17:47
書目名稱Mathematical Foundations of Computer Science 2015影響因子(影響力)
書目名稱Mathematical Foundations of Computer Science 2015影響因子(影響力)學(xué)科排名
書目名稱Mathematical Foundations of Computer Science 2015網(wǎng)絡(luò)公開度
書目名稱Mathematical Foundations of Computer Science 2015網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Mathematical Foundations of Computer Science 2015被引頻次
書目名稱Mathematical Foundations of Computer Science 2015被引頻次學(xué)科排名
書目名稱Mathematical Foundations of Computer Science 2015年度引用
書目名稱Mathematical Foundations of Computer Science 2015年度引用學(xué)科排名
書目名稱Mathematical Foundations of Computer Science 2015讀者反饋
書目名稱Mathematical Foundations of Computer Science 2015讀者反饋學(xué)科排名
作者: landfill 時(shí)間: 2025-3-21 22:00 作者: 偶像 時(shí)間: 2025-3-22 03:29
When Are Prime Formulae Characteristic?esents general, sufficient conditions guaranteeing that characteristic formulae are exactly the consistent and prime ones. It is shown that the given conditions apply to the logics characterizing all the semantics in van Glabbeek’s branching-time spectrum.作者: 1FAWN 時(shí)間: 2025-3-22 06:57
Recurrence Function on Sturmian Words: A Probabilistic Study of factor lengths which have a given “position” with respect to the sequence of continuants of ., we then let . to be uniformly drawn inside the unit interval [0,1]. This probabilistic model is well-adapted to better understand the role of the position in the recurrence properties.作者: TRAWL 時(shí)間: 2025-3-22 10:07
A Circuit Complexity Approach to Transductionscuits. To this end, a circuit framework of independent interest that allows variable output length is introduced. Relying on it, there is a general characterization of the set of transductions realizable by circuits. It is then decidable whether a transduction is definable in . and, assuming a well-established conjecture, the same for ..作者: 離開 時(shí)間: 2025-3-22 15:50
Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculusions bring about no extra expressivity to either of the two logics, “unbounded-memory” binary relations make the bisimulation-invariant fragment of . with path relation more expressive than the jumping mu-calculus: the existence of winning strategies in games with imperfect-information inhabits the gap.作者: 河潭 時(shí)間: 2025-3-22 20:05
Quasiperiodicity and Non-computability in Tilingsnique and make it enforce the property of local regularity of tilings needed for quasiperiodicity. We prove also a stronger result: any .-class can be recursively transformed into a tile set so that the Turing degrees of the resulting tilings consists exactly of the upper cone based on the Turing degrees of the latter.作者: Delectable 時(shí)間: 2025-3-23 00:02
Conference proceedings 2015ly selected from 201 submissions. The papers feature high-quality research in all branches of theoretical computer science. They have been organized in the following topical main sections: logic, semantics, automata, and theory of programming (volume 1) and algorithms, complexity, and games (volume 2).作者: 上釉彩 時(shí)間: 2025-3-23 03:46
Conference proceedings 2015 of Computer Science, MFCS 2015, held in Milan, Italy, in August 2015. The 82 revised full papers presented together with 5 invited talks were carefully selected from 201 submissions. The papers feature high-quality research in all branches of theoretical computer science. They have been organized i作者: VERT 時(shí)間: 2025-3-23 08:46
Locally Chain-Parsable Languagestly include the ID languages, and for which a parallel-parser generator exists. Consistently with the classical results for ID, chain-compatible LCPL are closed under reversal and Boolean operations, and language inclusion is decidable.作者: 整頓 時(shí)間: 2025-3-23 13:02
Weighted Automata and Logics on Graphsrom the recent literature for weighted automata and weighted logics on words, trees, pictures, and nested words. Establishing such a general result has been an open problem for weighted logic for some time.作者: 表兩個(gè) 時(shí)間: 2025-3-23 15:33
Reversible and Irreversible Computations of Deterministic Finite-State Devices equipped with storages are discussed, where we exemplarily stick with the storage types queue and pushdown store. In particular, the computational capacities, decidability problems, and closure properties are the main?topics covered, and we draw attention to the overall picture and some of the main ideas involved.作者: Serenity 時(shí)間: 2025-3-23 21:08
0302-9743 omputer science. They have been organized in the following topical main sections: logic, semantics, automata, and theory of programming (volume 1) and algorithms, complexity, and games (volume 2).978-3-662-48056-4978-3-662-48057-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 支架 時(shí)間: 2025-3-24 01:56
Classes of Languages Generated by the Kleene Star of a WordIn this paper, we study the lattice and the Boolean algebra, possibly closed under quotient, generated by the languages of the form ., where . is a word. We provide effective equational characterisations of these classes, i.e. one can decide using our descriptions whether a given regular language belongs or not to each of them.作者: 豪華 時(shí)間: 2025-3-24 05:28 作者: PANT 時(shí)間: 2025-3-24 08:28
Uniform Generation in Trace Monoidsn the boundary at infinity of the associated monoid. We obtain a product decomposition of the uniform measure at infinity if the trace monoid has several irreducible components—a case where other notions such as Parry measures, are not defined. Random generation algorithms are then examined.作者: 冥界三河 時(shí)間: 2025-3-24 14:18 作者: blight 時(shí)間: 2025-3-24 18:07
Longest Gapped Repeats and Palindromesosition . of the word ., the longest prefix . of .[....] such that . (respectively, .) is a suffix of . (defining thus a gapped repeat . – respectively, palindrome .), and the length of . is subject to various types of restrictions.作者: 音樂會(huì) 時(shí)間: 2025-3-24 22:53 作者: Left-Atrium 時(shí)間: 2025-3-25 00:26 作者: clarify 時(shí)間: 2025-3-25 05:10 作者: interior 時(shí)間: 2025-3-25 08:54
Mathematical Foundations of Computer Science 2015978-3-662-48057-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 高歌 時(shí)間: 2025-3-25 12:27
Minimal and Monotone Minimal Perfect Hash Functionss. In the static case (i.e., when the set . is known in advance), there is a wide spectrum of solutions available, offering different trade-offs in terms of construction time, access time and size of the data structure. MPHFs have been shown to be useful to compress data in several data management t作者: 枯萎將要 時(shí)間: 2025-3-25 17:32 作者: 好開玩笑 時(shí)間: 2025-3-25 23:46 作者: 埋葬 時(shí)間: 2025-3-26 02:27
Robust Inference and Local Algorithmsmight be corrupted. We survey a new and novel approach to model such possible corruption as a zero-sum game between an adversary that selects the corruption and a leaner that predict the correct label. The corruption of the observations is done in a worse-case setting, by an adversary, where the mai作者: cultivated 時(shí)間: 2025-3-26 04:56
Uniform Generation in Trace Monoidsn the boundary at infinity of the associated monoid. We obtain a product decomposition of the uniform measure at infinity if the trace monoid has several irreducible components—a case where other notions such as Parry measures, are not defined. Random generation algorithms are then examined.作者: 使閉塞 時(shí)間: 2025-3-26 11:24 作者: 優(yōu)雅 時(shí)間: 2025-3-26 14:41
Stochastization of Weighted Automata the sum of the weights on the transitions it traverses, and the weight of a word is the minimal weight of a run on it. In . (PWFAs), the transitions are further labeled by probabilities, and the weight of a word is the expected weight of a run on it. We define and study . of WFAs: given a WFA ., st作者: 禁止,切斷 時(shí)間: 2025-3-26 20:31
Algebraic Synchronization Criterion and Computing Reset Wordsms of linear algebra, and obtain upper bounds for the reset thresholds of automata with a short word of a small rank. The results are applied to make several improvements in the area..We improve the best general upper bound for reset thresholds of finite prefix codes (Huffman codes): we show that an作者: Congruous 時(shí)間: 2025-3-26 22:13 作者: Antioxidant 時(shí)間: 2025-3-27 03:52 作者: 等待 時(shí)間: 2025-3-27 07:25
A Circuit Complexity Approach to Transductionso study these interactions at a functional level, by investigating the deterministic rational transductions computable by constant-depth, polysize circuits. To this end, a circuit framework of independent interest that allows variable output length is introduced. Relying on it, there is a general ch作者: 畸形 時(shí)間: 2025-3-27 10:58
Locally Chain-Parsable Languagesndently, and an efficient parallel parsing algorithm becomes possible. The new class of locally chain-parsable languages (LCPL),?included in deterministic context-free languages, is here defined by means of the chain-driven automaton and characterized by decidable properties of grammar derivations. 作者: Individual 時(shí)間: 2025-3-27 14:12 作者: syncope 時(shí)間: 2025-3-27 18:47
Weighted Automata and Logics on Graphspictures, and nested words. In this paper, we introduce a general model of weighted automata acting on graphs, which form a quantitative version of Thomas’ unweighted model of graph acceptors. We derive a Nivat theorem for weighted graph automata which shows that their behaviors are precisely those 作者: graphy 時(shí)間: 2025-3-28 01:31
Longest Gapped Repeats and Palindromesosition . of the word ., the longest prefix . of .[....] such that . (respectively, .) is a suffix of . (defining thus a gapped repeat . – respectively, palindrome .), and the length of . is subject to various types of restrictions.作者: CREEK 時(shí)間: 2025-3-28 06:04
Quasiperiodicity and Non-computability in Tilingsthat accepts only quasiperiodic and non-recursive tilings. Our construction is based on the fixed point construction?[.]; we improve this general technique and make it enforce the property of local regularity of tilings needed for quasiperiodicity. We prove also a stronger result: any .-class can be作者: encomiast 時(shí)間: 2025-3-28 07:52
nslang für die Gesundheit essenziell. Das sensomotorische System (SMS), bestehend aus Sensoren, dem peripheren und zentralen Nervensystem und der Muskulatur, generiert alle erdenklichen Bewegungen. Die benannten Strukturen sind funktionell kreisf?rmig miteinander verknüpft und immer als Ganzes in Fu作者: BULLY 時(shí)間: 2025-3-28 10:52
Martin Kutribe course of dementia is high and can escalate as the disease progresses. These symptoms are often difficult to assess in the patient with dementia and effective treatment options are often limited. Palliative care interventions, whether through a primary provider or a palliative specialist, should i作者: intoxicate 時(shí)間: 2025-3-28 15:59 作者: perimenopause 時(shí)間: 2025-3-28 21:45 作者: nuclear-tests 時(shí)間: 2025-3-28 23:58
Samy Abbes,Jean Mairesseime, it is likely there have been conversations between clinicians and families regarding the degree of further life-sustaining treatment, and when appropriate and certain, care would have been witdrawn. How to go about that it difficult and requires expertise. Neuropalliative care in patients with 作者: IVORY 時(shí)間: 2025-3-29 04:41
L. Aceto,D. Della Monica,I. Fábregas,A. Ingólfsdóttirught to relate to their children. Because neuroparenting involves scientific expertise in the translation of babies’ needs, the parent is necessarily demoted. Mothers in particular are placed under considerable pressure to conform to this new idea of intensive motherhood: doing more and doing it ear作者: 流動(dòng)才波動(dòng) 時(shí)間: 2025-3-29 09:01
Guy Avni,Orna Kupfermanught to relate to their children. Because neuroparenting involves scientific expertise in the translation of babies’ needs, the parent is necessarily demoted. Mothers in particular are placed under considerable pressure to conform to this new idea of intensive motherhood: doing more and doing it ear作者: Evacuate 時(shí)間: 2025-3-29 14:04 作者: 在駕駛 時(shí)間: 2025-3-29 18:30
Micha?l Cadilhac,Andreas Krebs,Michael Ludwig,Charles Papermantoacoustic emissions, we classified their hearing impairment into three categories: neural hearing loss (group I, . = 7), mixture of neural and cochlear hearing loss (group II, . = 5), and cochlear hearing loss (group III, . = 38). In auditory brainstem response (ABR) examinations, only wave I was p作者: quiet-sleep 時(shí)間: 2025-3-29 22:56
Stefano Crespi Reghizzi,Violetta Lonati,Dino Mandrioli,Matteo Pradellatoacoustic emissions, we classified their hearing impairment into three categories: neural hearing loss (group I, . = 7), mixture of neural and cochlear hearing loss (group II, . = 5), and cochlear hearing loss (group III, . = 38). In auditory brainstem response (ABR) examinations, only wave I was p作者: CONE 時(shí)間: 2025-3-30 00:03
Laure Daviaud,Charles Paperman implantation has been successful for rehabilitation of children with AN, and that their altered neural synchrony can be restored by electrical stimulation introduced by cochlear implants. Most recipients achieved open-set speech perception abilities and showed progressive improvements in their comm作者: 脫水 時(shí)間: 2025-3-30 04:26 作者: finite 時(shí)間: 2025-3-30 11:02
Manfred Droste,Stefan Dücktoacoustic emissions, we classified their hearing impairment into three categories: neural hearing loss (group I, . = 7), mixture of neural and cochlear hearing loss (group II, . = 5), and cochlear hearing loss (group III, . = 38). In auditory brainstem response (ABR) examinations, only wave I was p作者: 脾氣暴躁的人 時(shí)間: 2025-3-30 14:45 作者: finite 時(shí)間: 2025-3-30 18:53
Bruno Durand,Andrei Romashchenko keinem dieser Krankheitsbilder obligat, sondern nur jeweils mit geringer bis sehr hoher Wahrscheinlichkeit anzutreffen. Wer in einer Patientengruppe tats?chlich neuropathische Schmerzen in Zusammenhang mit seiner Grundkrankheit erleben wird, kann nur sehr ungenau abgesch?tzt werden (z.B. geringe Wa作者: STYX 時(shí)間: 2025-3-30 21:04 作者: 幻想 時(shí)間: 2025-3-31 04:00 作者: Defiance 時(shí)間: 2025-3-31 07:09
Stochastization of Weighted Automataoximated determinization of WFAs. We study the problem of deciding, given a WFA . and a factor ., whether there is a stochastization of . that achieves an .-approximation. We show that the problem is in general undecidable, yet can be solved in PSPACE for a useful class of WFAs.作者: verdict 時(shí)間: 2025-3-31 09:29 作者: 開玩笑 時(shí)間: 2025-3-31 14:07
