標(biāo)題: Titlebook: Implementation and Application of Automata; 6th International Co Bruce W. Watson,Derick Wood Conference proceedings 2002 Springer-Verlag Be [打印本頁] 作者: 不正常 時間: 2025-3-21 19:39
書目名稱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é)科排名
作者: Legion 時間: 2025-3-21 21:47 作者: nurture 時間: 2025-3-22 02:57 作者: 引水渠 時間: 2025-3-22 07:13
Counting the Solutions of Presburger Equations without Enumerating Them, sets of solutions of arbitrary Presburger formulas, or the set of reachable states of some systems using unbounded integer variables. In this paper, we address the problem of counting the number of distinct elements in a set of vectors represented as an NDD. We give an algorithm that is able to per作者: 喃喃訴苦 時間: 2025-3-22 10:20 作者: 未成熟 時間: 2025-3-22 14:43
Finite Automata for Compact Representation of Language Models in NLP,presentation of such ., it is shown how finite-state automata can be used to compactly represent such language models. The technique can be seen as an application and extension of . by means of finite-state automata. Preliminary practical experiments indicate that the technique yields considerable a作者: 無脊椎 時間: 2025-3-22 18:06 作者: 磨坊 時間: 2025-3-22 21:19
Bounded-Graph Construction for Noncanonical Discriminating-Reverse Parsers,ections. This improves the precise recovery of conflicts’ right-hand contexts over the basic looping approach, and thus allows to extend the class of accepted grammars. Acceptance of at least all LALR(.) grammars, for a given ., is guaranteed. Moreover, the construction needs no subgraph copies. Sin作者: CULP 時間: 2025-3-23 01:25
Finite-State Transducer Cascade to Extract Proper Names in Texts,ize and to cluster texts with them. After a finite-state pre-processing (division of the text in sentences, tagging with dictionaries, etc.), a series of finite-state transducers is applied one after the other to the text and locates left and right contexts that indicates the presence of a person na作者: Emmenagogue 時間: 2025-3-23 07:50
Is this Finite-State Transducer Sequentiable?,ble. Sequentialization algorithms of finite state transducers do not recognize whether a transducer is sequentiable or not and simply do not ever halt when it is not. Choffrut proved that sequentiality of finite state transducers is decidable. Béal et al. have proposed . to decide sequentiality. We 作者: Exonerate 時間: 2025-3-23 11:25 作者: 虛度 時間: 2025-3-23 15:20 作者: 留戀 時間: 2025-3-23 19:40 作者: exostosis 時間: 2025-3-23 23:43
,Extraction of ε-Cycles from Finite-State Transducers,ich are a special type of non-determinism, from an arbitrary finite-state transducer (FST). The algorithm factorizes (decomposes) the FST, ., into two FSTs, . . and . ., such that . . contains no ε-cycles and . . contains all ε-cycles of .. Since ε-cycles are an obstacle for some algorithms such as 作者: 不愛防注射 時間: 2025-3-24 02:52 作者: 攀登 時間: 2025-3-24 09:09
Crystal Lattice Automata,d . . defining lattice points and their connections. These automata descriptions of crystal lattices reveal subtle properties that are difficult to see in other descriptions. A few applications of these automata are discussed.作者: ELATE 時間: 2025-3-24 14:34 作者: set598 時間: 2025-3-24 16:28
g eingesetzten Substanzen Probleme gr??eren Ausma?es auftreten, in erster Linie unerwünschte Arzneimittelwirkungen (UAW). Epidemiologische Studien zum Verordnungsverhalten von ?rzten gewinnen in der Medizin nur z?gernd an Bedeutung, obwohl wichtige Informationen über Medikamente unabh?ngig von spezi作者: Ingest 時間: 2025-3-24 21:29
I?aki Alegria,Maxux Aranzabe,Nerea Ezeiza,Aitzol Ezeiza,Ruben Urizarg eingesetzten Substanzen Probleme gr??eren Ausma?es auftreten, in erster Linie unerwünschte Arzneimittelwirkungen (UAW). Epidemiologische Studien zum Verordnungsverhalten von ?rzten gewinnen in der Medizin nur z?gernd an Bedeutung, obwohl wichtige Informationen über Medikamente unabh?ngig von spezi作者: Occlusion 時間: 2025-3-24 23:54 作者: 甜得發(fā)膩 時間: 2025-3-25 03:33 作者: 多嘴多舌 時間: 2025-3-25 10:18
Jan Daciuk,Gertjan van Noordigurations of the world and subjectivity within this: refigurations which parallel some of the fictions currently being mapped within a sphere of contemporary feminist philosophy. The aim is to consider the extent to which rave — as a lived social practice, and female ravers — as embodied cultural s作者: 合唱團 時間: 2025-3-25 12:43
Zhe Dang,Tevfik Bultan,Oscar H. Ibarra,Richard A. Kemmererigurations of the world and subjectivity within this: refigurations which parallel some of the fictions currently being mapped within a sphere of contemporary feminist philosophy. The aim is to consider the extent to which rave — as a lived social practice, and female ravers — as embodied cultural s作者: 有組織 時間: 2025-3-25 15:52 作者: antedate 時間: 2025-3-25 22:50
Jacques Farré,José Fortes Gálvezigurations of the world and subjectivity within this: refigurations which parallel some of the fictions currently being mapped within a sphere of contemporary feminist philosophy. The aim is to consider the extent to which rave — as a lived social practice, and female ravers — as embodied cultural s作者: 時代錯誤 時間: 2025-3-26 02:11
Nathalie Friburger,1]Denis Maureled, and many studies were published. However, with improved understanding and practice of the Ponseti techniques since the 1990s, the comprehensive release became less popular. While the Ponseti Method has proven to be quite effective in treating both the idiopathic and the syndromic clubfoot, recur作者: notice 時間: 2025-3-26 06:03
Tamás Gaáled, and many studies were published. However, with improved understanding and practice of the Ponseti techniques since the 1990s, the comprehensive release became less popular. While the Ponseti Method has proven to be quite effective in treating both the idiopathic and the syndromic clubfoot, recur作者: 常到 時間: 2025-3-26 08:44 作者: Systemic 時間: 2025-3-26 16:03
Jan Holubeful methods to demonstrate research methodology to graduate students. Several standardized techniques from basic to advanced molecular level have been included in this chapter for the researchers of cruciferous crop diseases. The clubroot pathogen identification and detection from soil and host tis作者: 人造 時間: 2025-3-26 17:19 作者: deforestation 時間: 2025-3-26 21:13
Frank Katritzke,Wolfgang Merzenich,Michael Thomast of patients with idiopathic hypogonadotropic hypogonadism (IHH) with physiological pulsatile GnRH has shown that approximately 25 % of patients do not respond as expected with normalization of testosterone gonadotropins and spermatogenesis. In some cases, the cause of the absence of response would作者: Ornithologist 時間: 2025-3-27 01:07 作者: 核心 時間: 2025-3-27 07:34 作者: 微生物 時間: 2025-3-27 12:03
Jim Morey,Kamran Sedig,Robert E. Mercer,Wayne Wilson the Soviet Union on Christmas Day 1991. It was not alone in its efforts to meet this daunting challenge. The Administration and Congress of the United States hoped to build a positive economic and political relationship with its former adversary. International financial institutions and Western don作者: 佛刊 時間: 2025-3-27 16:04 作者: ferment 時間: 2025-3-27 19:07 作者: hysterectomy 時間: 2025-3-27 23:36
Finite Automata for Compact Representation of Language Models in NLP, application and extension of . by means of finite-state automata. Preliminary practical experiments indicate that the technique yields considerable and important space savings of up to 90% in practice.作者: 鞏固 時間: 2025-3-28 03:11
Bounded-Graph Construction for Noncanonical Discriminating-Reverse Parsers,accepted grammars. Acceptance of at least all LALR(.) grammars, for a given ., is guaranteed. Moreover, the construction needs no subgraph copies. Since bounded-graph and basic looping constructions only differ in the accuracy of the conflicts’ right-hand contexts computation, the NDR parsing algorithm remains unchanged.作者: 冒煙 時間: 2025-3-28 07:41 作者: 騎師 時間: 2025-3-28 14:01 作者: morale 時間: 2025-3-28 16:03 作者: palliate 時間: 2025-3-28 19:24
On the Size of Deterministic Finite Automata,complexity of determinization is far lower. On the base of pioneering idea of homogenous finite automata, two classes of finite automata are defined and the complexity of their determinization are shown. These classes are called generalized homogenous finite automata and semihomogenous finite automata.作者: Blatant 時間: 2025-3-29 01:45
Using Finite State Technology in Natural Language Processing of Basque,rrector for Basque named Xuxen. The analyser is a basic tool for current and future work on NLP of Basque, such as the lemmatiser/tagger Euslem, an Intranet search engine or an assistant for verse-making.作者: consent 時間: 2025-3-29 03:06 作者: A精確的 時間: 2025-3-29 08:35 作者: NATAL 時間: 2025-3-29 14:51
Submodule Construction and Supervisory Control: A Generalization,authors for various assumptions about the underlying communication mechanisms and conformance relations. We present a generalization of this problem and its solution using concepts from relational database theory. We also show that several of the existing solutions are special cases of our general formulation作者: Temporal-Lobe 時間: 2025-3-29 15:51
Counting the Solutions of Presburger Equations without Enumerating Them,velop an efficient projection method that allows to construct efficiently NDDs from quantified formulas, and thus makes it possible to apply our counting technique to sets specified by formulas. Our algorithms have been implemented in the verification tool LASH, and applied successfully to various counting problems.作者: 委托 時間: 2025-3-29 23:12 作者: largesse 時間: 2025-3-30 01:40
Minimal Adaptive Pattern-Matching Automata for Efficient Term Rewriting,ies. Isomorphic subautomata are duplicated in the tree-based automata. We discuss and develop an efficient approach to space requirement optimisation, matching time and termination properties improvement.作者: choleretic 時間: 2025-3-30 04:51
,Brzozowski’s Derivatives Extended to Multiplicities,this set by coarser and coarser congruences which lead to an extension - in the case of multiplicities - of some classical results stated in the Boolean case. In particular, analogues of the well known theorems of Brzozowski and Antimirov are provided in this frame.作者: 殘暴 時間: 2025-3-30 11:53
Bit Parallelism - NFA Simulation,ter a short presentation of the basic simulation method, the bit parallelism is presented on one of the pattern matching problems. Then a flexibility of the bit parallelism is demonstrated by a simulation of . for other pattern matching problems.作者: Prognosis 時間: 2025-3-30 16:02 作者: CAB 時間: 2025-3-30 17:15 作者: Pert敏捷 時間: 2025-3-30 22:08
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/i/image/462523.jpg作者: Schlemms-Canal 時間: 2025-3-31 03:13
https://doi.org/10.1007/3-540-36390-4Simulation; algorithms; automata; automata computations; automata theory; cellular automata; finite automa作者: Infantry 時間: 2025-3-31 07:25 作者: Monolithic 時間: 2025-3-31 12:47 作者: Communal 時間: 2025-3-31 17:06
0302-9743 Overview: Includes supplementary material: 978-3-540-00400-4978-3-540-36390-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Heart-Attack 時間: 2025-3-31 18:51
Scheduling Hard Sporadic Tasks by Means of Finite Automata and Generating Functions,In a previous work, we propose a technique to decide feasability of periodic hard real-time systems based on finite automata. Here, associating generating functions (whose role is “to predict the future”) to a finite automaton, we extend this technique to hard sporadic tasks, independent or interdependent with the periodic tasks.作者: CODA 時間: 2025-3-31 23:41
