標(biāo)題: Titlebook: Implementation and Application of Automata; 15th International C Michael Domaratzki,Kai Salomaa Conference proceedings 2011 Springer Berlin [打印本頁] 作者: aspirant 時(shí)間: 2025-3-21 16:52
書目名稱Implementation and Application of Automata影響因子(影響力)
書目名稱Implementation and Application of Automata影響因子(影響力)學(xué)科排名
書目名稱Implementation and Application of Automata網(wǎng)絡(luò)公開度
書目名稱Implementation and Application of Automata網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Implementation and Application of Automata被引頻次
書目名稱Implementation and Application of Automata被引頻次學(xué)科排名
書目名稱Implementation and Application of Automata年度引用
書目名稱Implementation and Application of Automata年度引用學(xué)科排名
書目名稱Implementation and Application of Automata讀者反饋
書目名稱Implementation and Application of Automata讀者反饋學(xué)科排名
作者: Concrete 時(shí)間: 2025-3-21 22:42 作者: escalate 時(shí)間: 2025-3-22 01:52
Large-Scale Training of SVMs with Automata Kernels,achines used with sequence kernels that is purely based on weighted automata and transducer algorithms, without requiring any specific solver. The algorithms presented apply to a family of kernels covering all those commonly used in text and speech processing or computational biology. We show that t作者: CURL 時(shí)間: 2025-3-22 08:00 作者: 鳴叫 時(shí)間: 2025-3-22 11:09 作者: Handedness 時(shí)間: 2025-3-22 13:41
Finite Automata for Generalized Approach to Backward Pattern Matching,ass of problems. We describe a finite automaton for the basic pattern matching problem of finding an exact occurrence of one string in a text. We propose a mechanism to use simple operations over finite automata in a systematic approach to derive automata for solving problems from a defined class, s作者: Nefarious 時(shí)間: 2025-3-22 18:52 作者: 破譯密碼 時(shí)間: 2025-3-23 01:14
From Sequential Extended Regular Expressions to NFA with Symbolic Labels, enable the reuse of traditional verification techniques, it is necessary to translate SEREs into automata. SERE are regular expressions built over alphabets resulting from the state variables of the design under analysis. Thus, a traditional approach to generate the automaton would suffer from the 作者: AGGER 時(shí)間: 2025-3-23 04:07 作者: Myocyte 時(shí)間: 2025-3-23 07:39
Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract),009 we presented in [6] a (polynomial time) decision algorithm to decide regularity of the hairpin completion. In this paper we provide four new results: 1.) We show that the decision problem is .-complete. 2.) There is a polynomial time decision algorithm which runs in time ., this improves [6], wh作者: 狂亂 時(shí)間: 2025-3-23 13:16
On Straight Words and Minimal Permutators in Finite Transformation Semigroups,in the Cayley graph of a finite transformation semigroup with a fixed generator set. Of special interest are words that permute a given subset of the state set. Certain such words, called minimal permutators, are shown to comprise a code, and the straight ones comprise a finite code. Thus, words tha作者: 高談闊論 時(shí)間: 2025-3-23 16:05 作者: Simulate 時(shí)間: 2025-3-23 18:23 作者: 天空 時(shí)間: 2025-3-23 23:41
The Cayley-Hamilton Theorem for Noncommutative Semirings,mial. CHT has been extended from fields to commutative semirings by Rutherford in 1964. However, to the best of our knowledge, no result is known for noncommutative semirings. This is a serious limitation, as the class of regular languages, with finite automata as their recognizers, is a noncommutat作者: 我們的面粉 時(shí)間: 2025-3-24 05:03 作者: PAGAN 時(shí)間: 2025-3-24 07:21 作者: 冒失 時(shí)間: 2025-3-24 12:25 作者: BLANK 時(shí)間: 2025-3-24 16:05
vationen (=Ver?nderungen) haben, wird dies sp?testens bei der Umsetzung im Markt spüren. Innovationen sind dann besonders interessant, wenn man diese als Nichtbetroffener anschauen kann. Werden Menschen und Organisationen selbst von Innovationen erfasst, nehmen dieselben Menschen Ver?nderungen meist作者: 啜泣 時(shí)間: 2025-3-24 19:11
Nata?a JonoskaMitgliedern und f?rdert den Technologietransfer. In der Clusterinitiative arbeiten über 100 Mitglieder und Assoziierte – unter ihnen Forschungseinrichtungen, Technologielieferanten, Dienstleister, Anwender und Multiplikatoren – entlang der gesamten Wertsch?pfungskette Virtual Engineering zusammen, u作者: 反對 時(shí)間: 2025-3-25 02:26
Karen Rudieto twenty atoms, Nb., n?=?2–20, in three different charged states is presented including a systematic comparison of quantum chemical results with available experimental data to assign the lowest-lying structures of Nb. clusters and their IR spectra and some basic thermochemical parameters including 作者: 確保 時(shí)間: 2025-3-25 07:16 作者: 過于平凡 時(shí)間: 2025-3-25 08:44
Cyril Allauzen,Michael Riley,Johan Schalkwyk To this end, research groups have developed, combined and improved algorithms for the location of energetically low-lying structures of unitary and alloy clusters containing several metallic species. In this chapter, we review the methods by which global optimisation is performed on metallic alloy 作者: 托運(yùn) 時(shí)間: 2025-3-25 14:33
Marco Almeida,Nelma Moreira,Rogério Reis surveys many of the important developments that have occurred in this field since the publication in 1982 of the text “. by the present authors. Detailed updates are provided of the chemistry surrounding ditungsten, ditechnetium, and dirhenium complexes that possess quadruple bonds (σ.Π.δ. electron作者: 同義聯(lián)想法 時(shí)間: 2025-3-25 18:25 作者: 滔滔不絕地說 時(shí)間: 2025-3-25 23:50
José Bacelar Almeida,Nelma Moreira,David Pereira,Sim?o Melo de Sousaration and fabric weaving. Although there are firms of all sizes operating at the various stages of production, larger firms have become increasingly dominant as the industry has become more and more capital-intensive. More than half of the output of the industry is used by clothing manufacturers. T作者: 錫箔紙 時(shí)間: 2025-3-26 01:58 作者: expeditious 時(shí)間: 2025-3-26 07:23
Krzysztof Chmiel,Adam Romangical first steps was a more detailed study of the core of the Virgo cluster. Although it is not terribly rich, the Virgo cluster is several times nearer than any other rich cluster in the northern celestial hemisphere. Thus it is well suited for studies of the faint end of the cluster luminosity fu作者: Dorsal 時(shí)間: 2025-3-26 12:24 作者: 故意釣到白楊 時(shí)間: 2025-3-26 13:54 作者: projectile 時(shí)間: 2025-3-26 20:49
Volker Diekert,Steffen Kopeckiis investigated by analysing these excitations into their constituent electronic transition processes. We first make this transition-level analysis for dipole surface plasmons in an electron system confined within a small spherical particle. It is then made for multipole excitations in an electron g作者: DALLY 時(shí)間: 2025-3-27 00:23
Attila Egri-Nagy,Chrystopher L. Nehanivations to electronic, optical, magnetic, and other devices. Synthesizing specific clus- ters as a unit of useful nanostructures or controlling them as an assembly of nanocomposites is one of the ultimate purposes in this field. In order to understand how to synthesize individual clusters and t_o inv作者: 倒轉(zhuǎn) 時(shí)間: 2025-3-27 02:38 作者: 沒有準(zhǔn)備 時(shí)間: 2025-3-27 06:26
Wit Fory?,Piotr Oprocha,Slawomir Bakalarskiis investigated by analysing these excitations into their constituent electronic transition processes. We first make this transition-level analysis for dipole surface plasmons in an electron system confined within a small spherical particle. It is then made for multipole excitations in an electron g作者: 啜泣 時(shí)間: 2025-3-27 11:27
Radu Grosuis investigated by analysing these excitations into their constituent electronic transition processes. We first make this transition-level analysis for dipole surface plasmons in an electron system confined within a small spherical particle. It is then made for multipole excitations in an electron g作者: Flirtatious 時(shí)間: 2025-3-27 16:34
Michael Gerbush,Brent Heeringay are observed, and the field of science in which they are studied. Below we call clusters systems of bound atoms or molecules containing from several atoms (molecules) up to thousands, so that their structure can be essential for determining their properties. If clusters are like bulk systems, we c作者: 猛烈責(zé)罵 時(shí)間: 2025-3-27 19:41 作者: grounded 時(shí)間: 2025-3-28 01:14
J. Howard Johnsontermedium (ICM) produces copious X-ray emission, and typical cluster X-ray luminositiesare .. ~ 10. - 10. ergs s.. The total mass of intracluster gas generally exceeds the mass of all of the galaxies in a rich cluster. The gas is probably nearly hydrostatic. From the distribution of the intracluster作者: Homocystinuria 時(shí)間: 2025-3-28 02:38
Conference proceedings 2011ld in Manitoba, Winnipeg, Canada, in August 2010.The 26 revised full papers together with 6 short papers were carefully selected from 52 submissions. The papers cover various topics such as applications of automata in computer-aided verification; natural language processing; pattern matching, data s作者: penance 時(shí)間: 2025-3-28 09:40 作者: 修正案 時(shí)間: 2025-3-28 14:19 作者: Stricture 時(shí)間: 2025-3-28 16:13 作者: 接觸 時(shí)間: 2025-3-28 22:27
COMPAS - A Computing Package for Synchronization,package architecture and its main algorithms and some examples of use. COMPAS allows to easily operate on synchronizing automata, verifying new synchronizing algorithms etc. To the best of our knowledge, this is the first such flexible, extensible and open-source package for synchronization.作者: byline 時(shí)間: 2025-3-29 00:52
The Cayley-Hamilton Theorem for Noncommutative Semirings,noncommutative semirings. This is a serious limitation, as the class of regular languages, with finite automata as their recognizers, is a noncommutative idempotent semiring. In this paper we extend the CHT to noncommutative semirings. We also provide a simpler version of CHT for noncommutative idempotent semirings.作者: 發(fā)源 時(shí)間: 2025-3-29 05:42 作者: circumvent 時(shí)間: 2025-3-29 11:11
Conference proceedings 2011The papers cover various topics such as applications of automata in computer-aided verification; natural language processing; pattern matching, data storage and retrieval; bioinformatics; algebra; graph theory; and foundational work on automata theory.作者: CAPE 時(shí)間: 2025-3-29 13:56 作者: AND 時(shí)間: 2025-3-29 19:27
Large-Scale Training of SVMs with Automata Kernels,hese algorithms have significantly better computational complexity than previous ones and report the results of large-scale experiments demonstrating a dramatic reduction of the training time, typically by several orders of magnitude.作者: JADED 時(shí)間: 2025-3-29 22:24
Finite Automata for Generalized Approach to Backward Pattern Matching,uch as approximate matching, regular expression matching, sequence matching, matching of set of patterns, etc. and their combinations. The benefit of this approach is the ability to quickly derive solutions for newly formulated pattern matching problems.作者: figment 時(shí)間: 2025-3-30 03:23
Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract),ich provided .. 3.) For the one-sided case (which is closer to DNA computing) the time is ., only. 4.) The hairpin completion is unambiguous linear context-free. This result allows to compute the growth (generating function) of the hairpin completion and to compare it with the growth of the underlying regular language.作者: GULLY 時(shí)間: 2025-3-30 04:48
Symbolic Dynamics, Flower Automata and Infinite Traces,mely which instructions can be executed simultaneously (so that way we obtain a schedule for a process of parallel computation). In this paper we investigate when obtained in such a way objects (sets of infinite real traces) are well defined from the dynamical point of view and to what extent they share properties of underlying flower shifts.作者: 巨碩 時(shí)間: 2025-3-30 12:17 作者: invulnerable 時(shí)間: 2025-3-30 14:48
Using Automata to Describe Self-Assembled Nanostructures,tals, biomolecular cages such as viral capsids and for computing. We show an algebraic model for describing and characterizing nanostructures built by a set of molecular building blocks. This algebraic approach connects the classifcal view of crystal dissection with a more modern system based on algebraic automata theory.作者: depreciate 時(shí)間: 2025-3-30 17:25 作者: 流逝 時(shí)間: 2025-3-30 22:18 作者: 壓迫 時(shí)間: 2025-3-31 02:44
On Lazy Representations and Sturmian Graphs,al number .. We prove that for any non-negative integer . the unique path weighted . in the Sturmian graph associated with . represents the lazy representation of . in the Ostrowski numeration system associated with .. Moreover, we provide several properties of the representations of the natural integers in this numeration system.作者: 有惡臭 時(shí)間: 2025-3-31 07:30
Transductions Computed by PC-Systems of Monotone Deterministic Restarting Automata,ministic restarting automata yield a characterization of pushdown transductions. Then we study the class of transductions that are computed by . (PC-systems) of monotone deterministic restarting automata. We will see that this class includes all transductions that are computable.作者: DAFT 時(shí)間: 2025-3-31 12:56 作者: stressors 時(shí)間: 2025-3-31 14:02 作者: BROW 時(shí)間: 2025-3-31 20:26 作者: 好開玩笑 時(shí)間: 2025-4-1 00:21
Implementation and Application of Automata978-3-642-18098-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 外星人 時(shí)間: 2025-4-1 04:42
Partial Derivative Automata Formalized in ,,In this paper we present a computer assisted proof of the correctness of a partial derivative automata construction from a regular expression within the . proof assistant. This proof is part of a formalization of Kleene algebra and regular languages in . towards their usage in program certification.作者: airborne 時(shí)間: 2025-4-1 09:38
Regular Geometrical Languages and Tiling the Plane,We show that if a binary language . is regular, prolongable and geometrical, then it can generate, on certain assumptions, a .1 type tiling of a part of ?.. We also show that the sequence of states that appear along a horizontal line in such a tiling only depends on the shape of the tiling sub-figure and is somehow periodic.作者: 星球的光亮度 時(shí)間: 2025-4-1 10:59 作者: bypass 時(shí)間: 2025-4-1 17:50
Norbert Hundeshagen,Friedrich Otto,Marcel Vollweilerh neighboring nwnbers of atoms. The difference between clusters and small particles is such that parameters of small particles are monotonic functions of the nw978-1-4612-7082-9978-1-4612-1294-2Series ISSN 0938-037X 作者: 等待 時(shí)間: 2025-4-1 18:50
From Sequential Extended Regular Expressions to NFA with Symbolic Labels, been implemented in the . library, with Binary Decision Diagrams (BDD) used to represent transition labels..We carried out a thorough experimental evaluation over a set of realistic benchmarks, comparing our library against . (which uses deterministic finite automata with BDD-based symbolic transit
