標(biāo)題: Titlebook: Language and Automata Theory and Applications; 11th International C Frank Drewes,Carlos Martín-Vide,Bianca Truthe Conference proceedings 20 [打印本頁(yè)] 作者: cerebral 時(shí)間: 2025-3-21 19:07
書(shū)目名稱(chēng)Language and Automata Theory and Applications影響因子(影響力)
書(shū)目名稱(chēng)Language and Automata Theory and Applications影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Language and Automata Theory and Applications網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Language and Automata Theory and Applications網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Language and Automata Theory and Applications被引頻次
書(shū)目名稱(chēng)Language and Automata Theory and Applications被引頻次學(xué)科排名
書(shū)目名稱(chēng)Language and Automata Theory and Applications年度引用
書(shū)目名稱(chēng)Language and Automata Theory and Applications年度引用學(xué)科排名
書(shū)目名稱(chēng)Language and Automata Theory and Applications讀者反饋
書(shū)目名稱(chēng)Language and Automata Theory and Applications讀者反饋學(xué)科排名
作者: GIDDY 時(shí)間: 2025-3-21 21:07 作者: Granular 時(shí)間: 2025-3-22 01:50
Language and Automata Theory and Applications978-3-319-53733-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Foment 時(shí)間: 2025-3-22 04:43
-Memory Automata over the Alphabet ,discussion on its expressive power and closure properties, and show among other decidability results the solvability of the non-emptiness problem. We conclude with perspectives for applications and some open questions.作者: Spangle 時(shí)間: 2025-3-22 10:45 作者: LURE 時(shí)間: 2025-3-22 13:43 作者: 新鮮 時(shí)間: 2025-3-22 18:28
https://doi.org/10.1007/978-3-319-53733-7algorithmic learning; cellular automata; computational complexity; cyber-physical system; semantics; auto作者: Extemporize 時(shí)間: 2025-3-23 01:07
Two-Dimensional Palindromes and Their Propertiesand find the relation between the set of all 2D palindromes and the set of all 2D primitive words. We also show that the set of all 2D palindromes is not a recognizable language, and study a special class of 2D palindromes, namely 2D palindrome square words.作者: 碌碌之人 時(shí)間: 2025-3-23 04:14 作者: VOC 時(shí)間: 2025-3-23 08:34 作者: 折磨 時(shí)間: 2025-3-23 13:38 作者: Postmenopause 時(shí)間: 2025-3-23 16:54 作者: 增強(qiáng) 時(shí)間: 2025-3-23 18:24 作者: JOT 時(shí)間: 2025-3-24 01:48
Consensus String Problem for Multiple Regular Languages the consensus string problem for . regular languages using additive weighted finite automata. We show that the consensus string problem for multiple regular languages becomes intractable when . is not fixed. We also examine the case when the length of the consensus string is given as part of input.作者: panorama 時(shí)間: 2025-3-24 02:42 作者: 武器 時(shí)間: 2025-3-24 09:02 作者: Oratory 時(shí)間: 2025-3-24 13:33
The Strong, Weak, and Very Weak Finite Context and Kernel Propertiesassumed to hold of the target language for the dual algorithm to succeed. We also show that the weak finite context property is genuinely weaker than Clark’s ., settling a question raised by Yoshinaka.作者: 可商量 時(shí)間: 2025-3-24 17:08
An Automata View to Goal-Directed Methodsement, and optimize. In this paper, we show that consequence-based reasoning can be reduced to the emptiness test of an appropriately built automaton. Thanks to this reduction, one can focus on developing efficient consequence-based algorithms, obtaining complexity bounds and other benefits of automata methods for free.作者: Dungeon 時(shí)間: 2025-3-24 21:37 作者: Pessary 時(shí)間: 2025-3-25 00:15
On the Complexity of Hard Enumeration Problemsclasses analogous to the polynomial hierarchy and an appropriate notion of problem reduction are missing. In this work, we lay the foundations for a complexity theory of hard enumeration problems by proposing a hierarchy of complexity classes and by investigating notions of reductions for enumeration problems.作者: 生命 時(shí)間: 2025-3-25 06:14
Conference proceedings 2017issions. The papers cover the following topics: algorithmic learning and semantics; automata and logics; combinatorics on words, compression, and pattern matching; complexity; finite automata; grammars, languages, and parsing; graphs and Petri Nets; non-classical automata; and pushdown automata and systems..作者: vanquish 時(shí)間: 2025-3-25 08:03
Logic, Languages, and Rules for Web Data Extraction and Reasoning over Dataey theoretical results and formalisms that have been obtained and used in the context of the Lixto Project at TU Wien, the DIADEM project at the University of Oxford, and the VADA project, which is currently being carried out jointly by the universities of Edinburgh, Manchester, and Oxford. We start作者: 怒目而視 時(shí)間: 2025-3-25 14:44 作者: enmesh 時(shí)間: 2025-3-25 18:00
Efficient Learning of Tier-Based Strictly ,-Local Languages whose size is bounded by a constant. The TSL. languages are useful in modeling the cognition of sound patterns in natural language [., .], and it is known that they can be efficiently learned from positive data in the case that . [.]. We extend this result to any . and improve on its time efficienc作者: 巧思 時(shí)間: 2025-3-25 22:58
The Strong, Weak, and Very Weak Finite Context and Kernel Propertiesistributional learning algorithm and call them the .. We show that the very weak finite context property does not imply Yoshinaka’s ., which has been assumed to hold of the target language for the dual algorithm to succeed. We also show that the weak finite context property is genuinely weaker than 作者: 招人嫉妒 時(shí)間: 2025-3-26 03:37 作者: CLASP 時(shí)間: 2025-3-26 08:10
An Automata View to Goal-Directed Methodsogical formalisms. While automata are useful for finding tight complexity bounds, consequence-based algorithms are typically simpler to describe, implement, and optimize. In this paper, we show that consequence-based reasoning can be reduced to the emptiness test of an appropriately built automaton.作者: 克制 時(shí)間: 2025-3-26 09:29
Efficient Pattern Matching in Elastic-Degenerate Textsas an ordered collection of solid (standard) strings interleaved by .; each such symbol corresponds to a set of two or more variable-length solid strings. In this article, we present an algorithm for solving the pattern matching problem with a solid pattern and an elastic-degenerate text running in 作者: Pantry 時(shí)間: 2025-3-26 13:32 作者: evince 時(shí)間: 2025-3-26 19:38 作者: farewell 時(shí)間: 2025-3-27 00:13 作者: 彩色的蠟筆 時(shí)間: 2025-3-27 03:38 作者: 無(wú)思維能力 時(shí)間: 2025-3-27 05:29 作者: Abduct 時(shí)間: 2025-3-27 11:04 作者: 有幫助 時(shí)間: 2025-3-27 14:46 作者: eustachian-tube 時(shí)間: 2025-3-27 20:54
Georg Gottlob,Christoph Koch,Andreas Pierisc simulation is widely used in the industry, other methods exist as well, e.g. hardware error injection and fault-tolerance analysis using formal verification. As covering the entire space of all possible fault injections is impractical, nearly all workload-based error injection methods (e.g. simula作者: 庇護(hù) 時(shí)間: 2025-3-27 21:55 作者: thwart 時(shí)間: 2025-3-28 02:43
Thomas Troels Hildebrandt,Christian Johansen,H?kon Normannty of the problem, one usually considers bounded integers and then either linearizes the problem into a SMT(.)?problem (i.e., the theory of linear integer arithmetic with Boolean constraints) or bit-blasts into a SAT problem. We present a novel way of linearizing those constraints, and then show how作者: grovel 時(shí)間: 2025-3-28 09:44
Adam Jardine,Kevin McMullinals. More recently, this has grown to include software that manages critical hardware platform functions such as power management. This growing firmware needs to be shipped with the hardware and shares many of the same critical design concerns as the hardware. The two that we address in this paper a作者: Ointment 時(shí)間: 2025-3-28 12:26
Makoto Kanazawa,Ryo Yoshinakated to account for over half of the typical cost of software development. I will describe directed automated random testing (also known as concolic testing), an efficient approach which combines random and symbolic testing. Concolic testing enables automatic and systematic testing of programs, avoid作者: 變形 時(shí)間: 2025-3-28 18:34
discuss the idea of comprehensive and realistic modeling of biological systems, where we try to understand and analyze an entire system in detail, utilizing in the modeling effort all that is known about it. I will address the motivation for such modeling and the philosophy underlying the technique作者: 安定 時(shí)間: 2025-3-28 22:32
Benedikt Brütsch,Patrick Landwehr,Wolfgang Thomasanswer the question of unrealisability, i.e., “Is there a path violating a safety property regardless of the implementation of the black boxes?” Existing bounded model checking (BMC) approaches for incomplete timed systems exploit the power of modern SMT solvers, but might be too coarse as an abstra作者: 干旱 時(shí)間: 2025-3-29 02:21 作者: 傳授知識(shí) 時(shí)間: 2025-3-29 06:24
Ruggero Lanotte,Massimo Merroonalities. This causes the behavior of a verified application to deviate from its intended timing behavior when the application is integrated on a specific platform. For the same reason, a configuration of platforms cannot be independent from applications in most cases. This paper proposes a new ana作者: phlegm 時(shí)間: 2025-3-29 10:51 作者: Neuropeptides 時(shí)間: 2025-3-29 14:52
Costas S. Iliopoulos,Ritu Kundu,Solon P. Pissisonalities. This causes the behavior of a verified application to deviate from its intended timing behavior when the application is integrated on a specific platform. For the same reason, a configuration of platforms cannot be independent from applications in most cases. This paper proposes a new ana作者: eucalyptus 時(shí)間: 2025-3-29 18:36
Shmuel T. Klein,Dana Shapiraonalities. This causes the behavior of a verified application to deviate from its intended timing behavior when the application is integrated on a specific platform. For the same reason, a configuration of platforms cannot be independent from applications in most cases. This paper proposes a new ana作者: 顯赫的人 時(shí)間: 2025-3-29 21:08 作者: ascetic 時(shí)間: 2025-3-30 03:54 作者: 拱形大橋 時(shí)間: 2025-3-30 05:40 作者: landmark 時(shí)間: 2025-3-30 12:12 作者: Commentary 時(shí)間: 2025-3-30 16:10
Yo-Sub Han,Sang-Ki Ko,Timothy Ng,Kai Salomaa this field.Single and Multi-Objective Evolutionary Computation (MOEA), Genetic Algorithms (GAs), Artificial Neural Networks (ANNs), Fuzzy Controllers (FCs), Particle Swarm Optimization (PSO) and Ant colony Optimization (ACO) are becoming omnipresent in almost every intelligent system design. Unfort作者: 協(xié)奏曲 時(shí)間: 2025-3-30 16:33
Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Conc
