書目名稱Grammatical Inference: Theoretical Results and Applications影響因子(影響力)學(xué)科排名
書目名稱Grammatical Inference: Theoretical Results and Applications網(wǎng)絡(luò)公開度
書目名稱Grammatical Inference: Theoretical Results and Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Grammatical Inference: Theoretical Results and Applications被引頻次
書目名稱Grammatical Inference: Theoretical Results and Applications被引頻次學(xué)科排名
書目名稱Grammatical Inference: Theoretical Results and Applications年度引用
書目名稱Grammatical Inference: Theoretical Results and Applications年度引用學(xué)科排名
書目名稱Grammatical Inference: Theoretical Results and Applications讀者反饋
書目名稱Grammatical Inference: Theoretical Results and Applications讀者反饋學(xué)科排名
作者: 聚集 時(shí)間: 2025-3-21 22:41
Menschen verstehen – Potenziale erkennenWe introduce a new algorithm for sequential learning of Mealy automata by . (CGE). Our approach makes use of techniques from term rewriting theory and universal algebra for compactly representing and manipulating automata using finite congruence generator sets represented as . (SRS). We prove that the CGE algorithm correctly learns in the limit.作者: badinage 時(shí)間: 2025-3-22 01:57 作者: 案發(fā)地點(diǎn) 時(shí)間: 2025-3-22 06:06
CGE: A Sequential Learning Algorithm for Mealy AutomataWe introduce a new algorithm for sequential learning of Mealy automata by . (CGE). Our approach makes use of techniques from term rewriting theory and universal algebra for compactly representing and manipulating automata using finite congruence generator sets represented as . (SRS). We prove that the CGE algorithm correctly learns in the limit.作者: 六個(gè)才偏離 時(shí)間: 2025-3-22 09:13 作者: finite 時(shí)間: 2025-3-22 13:26 作者: finite 時(shí)間: 2025-3-22 18:29
,Modelle zur Erkl?rung von Kriminalit?t,ership queries by observing where each tuple of strings may occur in sentences of the language of the learning target. Our technique is based on Clark et al.’s work (ICGI 2008) on learning of a subclass of context-free languages. Our algorithm learns those context-free languages as well as many non-context-free languages.作者: BUOY 時(shí)間: 2025-3-23 00:01
Learning Regular Expressions from Representative Examples and Membership Queriesdepth 2. The learner uses one . example of the target language (where every occurrence of every loop in the target expression is unfolded at least twice) and a number of membership queries. The algorithm works in time polynomial in the length of the input example.作者: 調(diào)色板 時(shí)間: 2025-3-23 01:26
A Local Search Algorithm for Grammatical Inferencepresentative words chosen from a?(possibly infinite) context-free language and of a?finite set of counterexamples—words which do not belong to the language. The time complexity of the algorithm is polynomially bounded. The experiments have been performed for a?dozen or so languages investigated by other researchers and our results are reported.作者: osculate 時(shí)間: 2025-3-23 06:51 作者: Pigeon 時(shí)間: 2025-3-23 13:31 作者: 通便 時(shí)間: 2025-3-23 14:03
Distributional Learning of Some Context-Free Languages with a Minimally Adequate Teacher classes of the language. In this paper we consider learnability of context free languages using a .. We show that there is a natural class of context free languages, that includes the class of regular languages, that can be polynomially learned from a ., using an algorithm that is an extension of Angluin’s . algorithm.作者: 討厭 時(shí)間: 2025-3-23 18:17
Learning Automata Teamsa output by this algorithm to classify the test. Experimental results show that the use of automata teams improve the best known results for this type of algorithms. We also prove that the well known Blue-Fringe EDSM algorithm, which represents the state of art in merging states algorithms, suffices a polynomial characteristic set to converge.作者: 食品室 時(shí)間: 2025-3-24 01:15 作者: 裝飾 時(shí)間: 2025-3-24 05:58 作者: impaction 時(shí)間: 2025-3-24 08:34 作者: 匍匐前進(jìn) 時(shí)間: 2025-3-24 13:09 作者: nerve-sparing 時(shí)間: 2025-3-24 18:49 作者: 送秋波 時(shí)間: 2025-3-24 22:56 作者: NAUT 時(shí)間: 2025-3-25 00:58
Beate Steven,Rudolf Wei?,Keikawus Arastéh show how to use the flexibility of our translation in order to apply it to very hard problems. Experiments on a well-known suite of random DFA identification problems show that SAT solvers can efficiently tackle all instances. Moreover, our algorithm outperforms state-of-the-art techniques on several hard problems.作者: Juvenile 時(shí)間: 2025-3-25 04:40 作者: 珊瑚 時(shí)間: 2025-3-25 09:58 作者: 較早 時(shí)間: 2025-3-25 12:30 作者: 機(jī)械 時(shí)間: 2025-3-25 19:07 作者: incubus 時(shí)間: 2025-3-25 20:19
Bounding the Maximal Parsing Performance of Non-Terminally Separated Grammarsn achieve over a given treebank. We define a new metric, show that its optimization is NP-Hard but solvable with specialized software, and show a translation of the result to a bound for the ... We do experiments with the WSJ10 corpus, finding an .. bound of 76.1% for the UWNTS grammars over the POS tags alphabet.作者: 易怒 時(shí)間: 2025-3-26 04:13
https://doi.org/10.1007/978-3-658-20757-1 approach that has even been extended to the much more complex structures of proteins. Processive enzymes and other “molecular machines” can also be cast in terms of automata. This paper briefly reviews linguistic approaches to molecular biology, and provides perspectives on potential future applications of grammars and automata in this field.作者: 驕傲 時(shí)間: 2025-3-26 06:40 作者: maculated 時(shí)間: 2025-3-26 09:25
https://doi.org/10.1007/3-540-29434-1 respect to strong reducibility. We also introduce the notion of very strong reducibility and construct a complete symmetric BC-learnable class with respect to very strong reducibility. However, for EX-learnability, it is shown that there does not exist a symmetric class with respect to any weak, strong or very strong reducibility.作者: nutrition 時(shí)間: 2025-3-26 14:07 作者: 返老還童 時(shí)間: 2025-3-26 19:28
Glaube und Politik in Mecklenburggorithm. The result is the .?+ algorithm, which stands for .. .?+ is an efficient algorithm for identifying DRTAs from positive data. We show using artificial data that .?+ is capable of identifying sufficiently large DRTAs in order to identify real-world real-time systems.作者: 討好美人 時(shí)間: 2025-3-26 23:55
Molecules, Languages and Automata approach that has even been extended to the much more complex structures of proteins. Processive enzymes and other “molecular machines” can also be cast in terms of automata. This paper briefly reviews linguistic approaches to molecular biology, and provides perspectives on potential future applications of grammars and automata in this field.作者: 哀悼 時(shí)間: 2025-3-27 01:36
Inferring Regular Trace Languages from Positive and Negative Sampleson. After presenting the algorithm we provide a proof of its convergence (which is more complicated than the proof of convergence of the RPNI because there are no Minimal Automata for Asynchronous Automata), and we discuss the complexity of the algorithm.作者: 吞下 時(shí)間: 2025-3-27 08:24 作者: ethereal 時(shí)間: 2025-3-27 12:01 作者: Apoptosis 時(shí)間: 2025-3-27 15:25 作者: Rebate 時(shí)間: 2025-3-27 21:20 作者: 元音 時(shí)間: 2025-3-28 01:02
Using Grammar Induction to Model Adaptive Behavior of Networks of Collaborative Agentss. We have implemented our theoretical framework in a workbench that can be used to run simulations. We discuss some results of these simulations. We believe that this approach provides a viable framework to study processes of self-organization and optimization of collaborative agent networks.作者: Hippocampus 時(shí)間: 2025-3-28 04:50
Grammatical Inference: Theoretical Results and Applications作者: bleach 時(shí)間: 2025-3-28 07:15
https://doi.org/10.1007/978-3-322-86678-3niques such as Binary Feature Grammars and Distributional Lattice Grammars. The class of .s that can be learned in this way includes inherently ambiguous and thus non-deterministic languages; this approach therefore breaks through an important barrier in . inference.作者: Minutes 時(shí)間: 2025-3-28 11:53 作者: DEMN 時(shí)間: 2025-3-28 14:43
https://doi.org/10.1007/978-3-658-20757-1ther functional modules along the DNA sequence invites a syntactic view, which can be seen in certain tools used in bioinformatics such as hidden Markov models. It has also been shown that folding of RNA structures is neatly expressed by grammars that require expressive power beyond context-free, an作者: OFF 時(shí)間: 2025-3-28 21:21
Schritt 1: Chancen von neuen Ideen steigern,al commutation relation called the independence relation. This algorithm is similar to the RPNI algorithm, but it is based on Asynchronous Cellular Automata. For this purpose, we define Asynchronous Cellular Moore Machines and implement the merge operation as the calculation of an equivalence relati作者: 險(xiǎn)代理人 時(shí)間: 2025-3-29 01:54
Wandern: freiwillig oder erzwungen,. Clark and Eyraud (2007) showed that some context free grammars can be identified in the limit from positive data alone by identifying the congruence classes of the language. In this paper we consider learnability of context free languages using a .. We show that there is a natural class of context作者: Indebted 時(shí)間: 2025-3-29 05:47
https://doi.org/10.1007/978-3-322-86678-3 a context sensitive formalism. Here we examine the possibility of basing a context free grammar (.) on the structure of this lattice; in particular by choosing non-terminals to correspond to concepts in this lattice. We present a learning algorithm for context free grammars which uses positive data作者: crockery 時(shí)間: 2025-3-29 11:02
Rechtsschutz ist besser als Staatslenkung,stent way, converges to the minimum . for the target language in the limit. This fact is used to learn automata teams, which use the different automata output by this algorithm to classify the test. Experimental results show that the use of automata teams improve the best known results for this type作者: Fsh238 時(shí)間: 2025-3-29 14:12 作者: Palpate 時(shí)間: 2025-3-29 16:08
Es war einmal … und geht noch weiter!lem of learning workflows from traces of processing. In this paper, we are concerned with learning workflows from . traces captured during the concurrent processing of multiple task instances. We first present an abstraction of the problem of recovering workflows from interleaved example traces in t作者: PLIC 時(shí)間: 2025-3-29 21:12 作者: Creditee 時(shí)間: 2025-3-30 00:49 作者: 馬籠頭 時(shí)間: 2025-3-30 06:39
,Phasenmodelle für Führungsgespr?che, concept of Non-Terminally Separated (NTS) languages by adding a fixed size context to the constituents, in the analog way as .,.-substitutable languages generalize substitutable languages (Yoshinaka, 2008). .,.-NTS. languages are .,.-NTS languages that also consider the edges of sentences as possib作者: 鎮(zhèn)壓 時(shí)間: 2025-3-30 08:17 作者: 殘忍 時(shí)間: 2025-3-30 13:16
F?higkeiten eines guten Beurteilersis based on an extension of the classical language learning setting in which a teacher provides examples to a student that must guess a correct grammar. In our model the teacher is transformed in to a workload dispatcher and the student is replaced by an organization of worker-agents. The jobs that 作者: 知道 時(shí)間: 2025-3-30 19:55 作者: 疏忽 時(shí)間: 2025-3-30 23:13
Die Mauer als emblematisches Motiv,on of a generalisation operator called .. For sequence classification tasks, . is a learner that only uses positive examples. We show that . has already defined such learners for automata classes like . or .. Then we propose a generalisation algorithm for the class of balls of words. Finally, we sho作者: 樂器演奏者 時(shí)間: 2025-3-31 04:07 作者: 雀斑 時(shí)間: 2025-3-31 06:37 作者: Consensus 時(shí)間: 2025-3-31 12:20 作者: 量被毀壞 時(shí)間: 2025-3-31 17:06
