標(biāo)題: Titlebook: Language and Automata Theory and Applications; 10th International C Adrian-Horia Dediu,Jan Janou?ek,Bianca Truthe Conference proceedings 20 [打印本頁] 作者: Baleful 時(shí)間: 2025-3-21 17:21
書目名稱Language and Automata Theory and Applications影響因子(影響力)
書目名稱Language and Automata Theory and Applications影響因子(影響力)學(xué)科排名
書目名稱Language and Automata Theory and Applications網(wǎng)絡(luò)公開度
書目名稱Language and Automata Theory and Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Language and Automata Theory and Applications被引頻次
書目名稱Language and Automata Theory and Applications被引頻次學(xué)科排名
書目名稱Language and Automata Theory and Applications年度引用
書目名稱Language and Automata Theory and Applications年度引用學(xué)科排名
書目名稱Language and Automata Theory and Applications讀者反饋
書目名稱Language and Automata Theory and Applications讀者反饋學(xué)科排名
作者: 有特色 時(shí)間: 2025-3-21 22:56 作者: 受傷 時(shí)間: 2025-3-22 02:06 作者: 漸強(qiáng) 時(shí)間: 2025-3-22 07:28 作者: 樂章 時(shí)間: 2025-3-22 09:03 作者: Adherent 時(shí)間: 2025-3-22 15:43 作者: euphoria 時(shí)間: 2025-3-22 19:16 作者: 輕推 時(shí)間: 2025-3-22 21:52 作者: conquer 時(shí)間: 2025-3-23 02:36 作者: ungainly 時(shí)間: 2025-3-23 06:34
Frank Wolteral examples, the classifier trained by GanDef shows the same level of test accuracy as those trained by state-of-the-art adversarial training defenses. More importantly, ., a variant of GanDef, could utilize the discriminator to achieve a dynamic trade-off between correctly classifying original and 作者: ACRID 時(shí)間: 2025-3-23 13:05 作者: aphasia 時(shí)間: 2025-3-23 14:52 作者: hedonic 時(shí)間: 2025-3-23 19:27
Parvaneh Babari,Nicole Schweikardtthis paper, we construct a classification model to detect homographs and potential homographs registered by attackers using machine learning on feasible and novel features which are the visual similarity on each character and some selected information from Whois. The implementation results show that作者: 類似思想 時(shí)間: 2025-3-23 23:47 作者: Ischemic-Stroke 時(shí)間: 2025-3-24 02:26
Dana Fismanes with 12’216 personalized contextual sharing decisions. Evaluation experiments were performed and the results show a promising performance of the proposed model for photo sharing decision making. Furthermore, the influences of different types of features on decision making have been investigated, 作者: mastopexy 時(shí)間: 2025-3-24 09:17
Vahid Hashemi,Holger Hermanns,Lei Song,K. Subramani,Andrea Turrini,Piotr Wojciechowskiprocess discovery algorithms to satisfy these requirements. Secondly, the comparison was performed and validated using ICS logs derived from a case study, containing successful attacks on industrial control systems. Our research shows that the Inductive Miner process discovery method, without the us作者: Density 時(shí)間: 2025-3-24 14:29
Heiko Vogler,Manfred Droste,Luisa Herrmannponents verifying each other. We provide ProVerif proofs to show the correctness of the network protocol one-by-one assuming each device compromised..Furthermore, we added a self-healing mechanism based on invariants to the architecture on network as well as system level which will reset failed or c作者: Hyperopia 時(shí)間: 2025-3-24 14:49 作者: 膠水 時(shí)間: 2025-3-24 21:50
Rajeev Alur,Dana Fismanprocess discovery algorithms to satisfy these requirements. Secondly, the comparison was performed and validated using ICS logs derived from a case study, containing successful attacks on industrial control systems. Our research shows that the Inductive Miner process discovery method, without the us作者: 雇傭兵 時(shí)間: 2025-3-25 02:05 作者: artless 時(shí)間: 2025-3-25 05:59 作者: 含鐵 時(shí)間: 2025-3-25 11:06 作者: 類型 時(shí)間: 2025-3-25 15:42 作者: 高調(diào) 時(shí)間: 2025-3-25 18:07 作者: LUDE 時(shí)間: 2025-3-25 23:53
A Logical Characterization for Dense-Time Visibly Pushdown Automatall as resets visible. We present MSO logic characterization of these automata and prove the decidability of the emptiness problem for these automata paving way for verification problem for dense-timed pushdown automata against dense-timed visibly pushdown automata specification.作者: 血統(tǒng) 時(shí)間: 2025-3-26 03:30 作者: 允許 時(shí)間: 2025-3-26 05:28 作者: myelography 時(shí)間: 2025-3-26 08:56
Reasoning with Prototypes in the Description Logic , Using Weighted Tree Automatarity tree automata (wapta) over the non-negative integers can be used to define pdfs, and how this allows us to use both concepts and pointed interpretations as prototypes. Finally, we investigate the complexity of reasoning in ., which extends the Description Logic . with the constructors . for pdfs defined using wapta.作者: Spinal-Tap 時(shí)間: 2025-3-26 15:43 作者: Evacuate 時(shí)間: 2025-3-26 17:17
A Weighted MSO Logic with Storage Behaviour and Its Büchi-Elgot-Trakhtenbrot Theoremrage. In particular, this implies a Büchi-Elgot-Trakhtenbrot Theorem for weighted iterated pushdown languages. For this choice of storage type, the satisfiability problem of the logic is decidable for each bounded lattice provided that its infimum is computable.作者: 臆斷 時(shí)間: 2025-3-27 00:14 作者: Aprope 時(shí)間: 2025-3-27 02:48 作者: Clinch 時(shí)間: 2025-3-27 07:45 作者: 我說不重要 時(shí)間: 2025-3-27 12:11
0302-9743 ta Theory and Applications, LATA 2016, held inPrague, Czech Republic, in March 2016...The 42 revised full papers presented together with 5 invited talks werecarefully reviewed and selected from 119 submissions. The papers cover thefollowing topics: algebraic language theory; algorithms for semi-stru作者: quiet-sleep 時(shí)間: 2025-3-27 14:02 作者: Flavouring 時(shí)間: 2025-3-27 19:50
Language and Automata Theory and Applications978-3-319-30000-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: goodwill 時(shí)間: 2025-3-28 01:25
https://doi.org/10.1007/978-3-319-30000-9algebraic language theory; bioinformatics; cellular automata; graphs and graph transformation; term rewr作者: 胎兒 時(shí)間: 2025-3-28 03:52
Adrian-Horia Dediu,Jan Janou?ek,Bianca TrutheIncludes supplementary material: 作者: calamity 時(shí)間: 2025-3-28 07:05 作者: insightful 時(shí)間: 2025-3-28 12:18
Tangles and Connectivity in GraphsThis paper is a short introduction to the theory of tangles, both in graphs and general connectivity systems. An emphasis is put on the correspondence between tangles of order . and .-connected components. In particular, we prove that there is a one-to-one correspondence between the triconnected components of a graph and its tangles of order?3.作者: Engaging 時(shí)間: 2025-3-28 16:08 作者: 辮子帶來幫助 時(shí)間: 2025-3-28 22:05 作者: leniency 時(shí)間: 2025-3-29 02:14 作者: 一加就噴出 時(shí)間: 2025-3-29 03:59
Non-Zero Sum Games for Reactive Synthesist publications. These solution concepts are developed in the context of non-zero sum games played on graphs. They are part of the contributions obtained in the . project funded by the European Research Council.作者: NEEDY 時(shí)間: 2025-3-29 07:56 作者: resilience 時(shí)間: 2025-3-29 13:41
Reasoning with Prototypes in the Description Logic , Using Weighted Tree Automataototype distance functions (pdfs), which assign to each element of an interpretation a distance value. Based on this, we define a new concept constructor of the form . for ., which is interpreted as the set of all elements with a distance . according to the pdf .. We show how weighted alternating pa作者: 珠寶 時(shí)間: 2025-3-29 15:40
,-Picture Languages Recognizable by Büchi-Tiling Systemsiling systems with a Büchi acceptance condition and define the class of Büchi-tiling recognizable .-picture languages. We show that this class has the same closure properties as the class of tiling recognizable languages of finite pictures. We characterize the class of Büchi-tiling recognizable .-pi作者: 驚呼 時(shí)間: 2025-3-29 20:08
A Logical Characterization for Dense-Time Visibly Pushdown Automatae visibly pushdown automata (VPA) by Alur and Madhusudan and event-clock automata (ECA) by Alur, Fix and Henzinger. VPA and ECA—by making the call-return edges visible and by making the clock-reset operation visible, respectively—recover decidability for the verification problem for pushdown automat作者: 獨(dú)行者 時(shí)間: 2025-3-30 01:01 作者: appall 時(shí)間: 2025-3-30 05:54 作者: 舔食 時(shí)間: 2025-3-30 10:45
A Weighted MSO Logic with Storage Behaviour and Its Büchi-Elgot-Trakhtenbrot Theorem we take unital valuation monoids which include all semirings, bounded lattices, and computations of average or discounted costs. Each formula is interpreted over finite words yielding elements in the weight structure. We prove that this logic is expressively equivalent to weighted automata with sto作者: Femish 時(shí)間: 2025-3-30 12:51
Colored Nested Wordsop actions are directed by the hierarchical structure in the input nested word. The resulting class of regular languages of nested words has many appealing theoretical properties, and has found many applications, including model checking of procedural programs. In the nested word model, the hierarch作者: Memorial 時(shí)間: 2025-3-30 20:07
Input-Driven Queue Automata with Internal Transductionse solely governed by the input symbols. Here, this model is extended in such a way that the input of an . is preprocessed by an internal deterministic sequential transducer. These automata are called tinput-driven queue automata (.). It turns out that even .s with weak, that is, deterministic inject作者: Conduit 時(shí)間: 2025-3-30 20:57 作者: gangrene 時(shí)間: 2025-3-31 01:23
Minimal Separating Sequences for All Pairs of Statesinimal separating sequences, for instance, play a central role in many conformance testing methods. Moore has already outlined a partition refinement algorithm that constructs such a set of sequences in . time, where . is the number of transitions and . is the number of states. In this paper, we pre作者: 容易懂得 時(shí)間: 2025-3-31 08:22 作者: 字謎游戲 時(shí)間: 2025-3-31 11:35
itions of the system boundary as the main reason for this large spread. The decision of whether or not to include end devices influences the result by 1–2 orders of magnitude. If end devices are excluded, customer premises equipment (CPE) and access networks have a dominant influence. Of less influe作者: Rinne-Test 時(shí)間: 2025-3-31 14:40
