標(biāo)題: Titlebook: Implementation and Application of Automata; 10th International C Jacques Farré,Igor Litovsky,Sylvain Schmitz Conference proceedings 2006 Sp [打印本頁] 作者: Affordable 時間: 2025-3-21 16:15
書目名稱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é)科排名
作者: offense 時間: 2025-3-21 20:14 作者: FIS 時間: 2025-3-22 01:24 作者: Morbid 時間: 2025-3-22 07:20
Wind in the Willows – Generating Music by Means of Tree Transducerse of formal devices, familiar from the field of tree grammars and tree transducers. Since these devices are well studied, we can apply known results to derive the descriptive complexity of the system as a whole.作者: Rct393 時間: 2025-3-22 12:27
Experiments with Deterministic ,-Automata for Formulas of Linear Temporal Logicown algorithms to construct a nondeterministic Büchi automaton for the given formula on which we then apply a determinization algorithm. We study here in detail Safra’s determinization algorithm, present several heuristics that attempt to decrease the size of the resulting automata and report on experimental results.作者: figment 時間: 2025-3-22 13:16
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/i/image/462537.jpg作者: fetter 時間: 2025-3-22 18:25
https://doi.org/10.1007/11605157Alphabet; XML processing; algorithm; algorithms; automata implementations; cognition; complexity theory; fi作者: 熱烈的歡迎 時間: 2025-3-22 22:10 作者: Crepitus 時間: 2025-3-23 04:42 作者: motor-unit 時間: 2025-3-23 09:08 作者: Directed 時間: 2025-3-23 13:05
0302-9743 Overview: 978-3-540-31023-5978-3-540-33097-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Anticonvulsants 時間: 2025-3-23 16:32 作者: ETCH 時間: 2025-3-23 21:20 作者: nascent 時間: 2025-3-24 02:01
Prime Normal Form and Equivalence of Simple Grammars to .(.. log..) and .(.. polylog .) deterministic time, and .(.. polylog .) randomized time, where . is the total size of the grammars involved, and . is the length of a shortest string derivable from a nonterminal, maximized over all nonterminals. Our improvement is based on a version of Caucal’s algorithm from [1].作者: 售穴 時間: 2025-3-24 04:14
Shorter Regular Expressions from Finite-State Automatanate all non-bridge states to obtain shorter regular expressions. In addition, we suggest heuristics for state elimination that lead to shorter regular expressions based on vertical chopping and horizontal chopping..Note that we have omitted almost all proofs in this preliminary version.作者: Blood-Clot 時間: 2025-3-24 09:00
Component Composition Preserving Behavioural Contracts Based on Communication Tracesdeed compositional and yields a new component or . that respects its constituents’ contracts. Thus the behaviour of the composite is computed from the behaviours of its constituents and is known to conform to the contracts without any new proof.作者: Accord 時間: 2025-3-24 12:14
An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automatawhen the number of states in the DFCA is significantly less than the number of states in the corresponding minimal DFA. We have implemented the proposed algorithm and have tested it against the best known DFCA minimization technique.作者: folliculitis 時間: 2025-3-24 16:26 作者: meditation 時間: 2025-3-24 19:42
A Class of Rational ,-WFSM Auto-intersectionsne a class of triples 〈., ., .〉 such that the auto-intersection of the machine . on tapes . and . can be computed by a delay-based algorithm. We point out how to extend this class and hope that it is sufficient for many practical applications.作者: Oversee 時間: 2025-3-25 01:21 作者: 不出名 時間: 2025-3-25 05:35
Computing Affine Hulls over , and , from Sets Represented by Number Decision Diagrams vectors represented by the NDD, and |.| and Σ. are the number of states and the alphabet of the NDD. On a prototype implementation, the computations of affine hulls of NDDs with more than 100000 states are done in seconds.作者: 碎片 時間: 2025-3-25 08:50
Restricting the Use of Auxiliary Symbols for Restarting Automata, we consider the . on the tape as a dynamic complexity measure. We establish some lower and upper bounds with respect to these complexity measures concerning the ability of restarting automata to recognize the (deterministic) context-free languages and some of their subclasses.作者: 補(bǔ)充 時間: 2025-3-25 11:55 作者: Highbrow 時間: 2025-3-25 19:28 作者: Cursory 時間: 2025-3-25 20:59 作者: 決定性 時間: 2025-3-26 01:27
On Deterministic Catalytic Systemsually halts..It is known that a 1-membrane catalytic system is universal in the sense that any unary recursively enumerable language can be accepted by a 1-membrane catalytic system (even by purely catalytic systems, i.e., when all rules are of the form . →. ). A catalytic system is said to be . if 作者: 帶來的感覺 時間: 2025-3-26 07:20
Cédric Bastien,Jurek Czyzowicz,Wojciech Fraczak,Wojciech Ryttertransmitters of the brain including dopamine, norepinephrine and serotonin [10]. The pharmacological target for treatment of psychiatric illnesses is to increase the concentration of these neurotransmitters at effect site by either inhibiting the metabolism or reducing the reuptake at nerve ending. 作者: 僵硬 時間: 2025-3-26 10:16 作者: Cytokines 時間: 2025-3-26 13:24
Antonio Cano,Pedro Garcíae: respecting cyber sovereignty; maintaining peace and protection; promoting opennessand cooperation; and building good order to provide network system security. ..There maybe three scales of application scenario for MIN, the big one is for UN of Cyberspace, the middle one is for Smart city, the sma作者: 補(bǔ)角 時間: 2025-3-26 18:58
Thomas Claveirole,Sylvain Lombardy,Sarah O’Connor,Louis-No?l Pouchet,Jacques Sakarovitche distributed computer-mediated communication systems by organizations. The results found in this study suggested that the distributed mode of group problem solving is not only a viable alternative but also a promising decision-making process..Additional studies are needed to expand the results pres作者: cravat 時間: 2025-3-27 00:51 作者: 悄悄移動 時間: 2025-3-27 03:53
Johanna H?gberge distributed computer-mediated communication systems by organizations. The results found in this study suggested that the distributed mode of group problem solving is not only a viable alternative but also a promising decision-making process..Additional studies are needed to expand the results pres作者: 逗它小傻瓜 時間: 2025-3-27 09:06
Oscar H. Ibarra,Hsu-Chun YenSuch an extension also requires consideration of additional frameworks that help understand and resolve group decision-making such as aggregation of preferences and consensus seeking..Before elaborating on the requirements analysis and design issues for cooperative multiple criteria group DSS, it is作者: 屈尊 時間: 2025-3-27 12:18
Tomasz Jurdziński,Friedrich Ottoe both high relationship/low task and low task/low relationship problems. For the former problem type, a less structured, more creative and intuitive form of decision making is called for, and for the latter type an individual decision maker with perhaps the help of an IDSS should be used..Obviously作者: AV-node 時間: 2025-3-27 14:30
Joachim Klein,Christel Baierportant role in this by screening for ADHD. Treatment options may include medication, although convincing evidence of effect in SUD populations is yet lacking, and cognitive behavioral therapy. As problems of SUD and ADHD can be intertwined, it is appropriate to start ADHD treatment during SUD treat作者: 時代錯誤 時間: 2025-3-27 19:20 作者: 思想流動 時間: 2025-3-27 23:06 作者: 未成熟 時間: 2025-3-28 04:33 作者: 雪白 時間: 2025-3-28 09:01 作者: prosperity 時間: 2025-3-28 12:02 作者: 分解 時間: 2025-3-28 17:34
Minimization of Non-deterministic Automata with Large Alphabetss the one suggested by Paige and Tarjan. The algorithm has a complexity of .(. log .) where . is the number of edges and . is the number of states in the automaton. A bottleneck in the application of the algorithm is often the number of labels which may appear on the edges of the automaton. In this 作者: 偉大 時間: 2025-3-28 19:05
Simulating Two-Dimensional Recognizability by Pushdown and Queue Automataer to encompass a wider class of languages. We show that any (tiling) recognizable language can be simulated by a 4NFA with an extra queue whose size is bounded by the minimum of the two dimensions of a picture; and that 2NFA (i.e. automata moving only in two directions) with an analogous queue are 作者: 石墨 時間: 2025-3-28 23:04 作者: 時代 時間: 2025-3-29 05:02 作者: Aggressive 時間: 2025-3-29 07:39
Prime Normal Form and Equivalence of Simple Grammarsl time if a language generated by a simple context-free grammar is a prime. Our algorithm computes a canonical representation of a simple language, converting its arbitrary simple grammar into Prime Normal Form (PNF); a simple grammar is in PNF if all its nonterminals define primes. We also improve 作者: BOLT 時間: 2025-3-29 11:37
An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata less states than the DFA for ., this technique seems to be the best choice for incrementally building the automaton for a large language, especially when the number of states in the DFCA is significantly less than the number of states in the corresponding minimal DFA. We have implemented the propos作者: CODE 時間: 2025-3-29 19:34
Finite Automata and Unions of Regular Patterns with Bounded Constant Segmentsse, no efficient algorithm that performs the inference of this class of languages is known. We propose a solution to this problem using the existing connexion between the positive variety of languages of dot depth 1/2, . [2] and the class of unbounded union of pattern languages ..作者: 樂章 時間: 2025-3-29 22:31
Inside Vaucansontient, conversion of a regular expression into a weighted automaton, and composition). We explain how complex declarations due to the generic programming are masked from the user and finally we present a proposal for an XML format that allows implicit descriptions for simple types of automata.作者: arousal 時間: 2025-3-30 00:00
Deterministic Recognition of Trees Accepted by a Linear Pushdown Tree AutomatonDTAs) is proposed. L-PDTAs accept an important class of tree languages since the class of their yield languages coincides with the class of yield languages generated by tree adjoining grammars (TAGs). The proposed algorithm is obtained by combining a bottom-up parsing procedure on trees with the CKY作者: emission 時間: 2025-3-30 06:26
Shorter Regular Expressions from Finite-State Automatave method for computing regular expressions from finite-state automata, the resulting regular expressions are often very long and complicated. We examine the minimization of finite-state automata to obtain shorter expressions first. Then, we introduce vertical chopping based on bridge states and hor作者: indigenous 時間: 2025-3-30 10:42
Wind in the Willows – Generating Music by Means of Tree Transducerse of formal devices, familiar from the field of tree grammars and tree transducers. Since these devices are well studied, we can apply known results to derive the descriptive complexity of the system as a whole.作者: left-ventricle 時間: 2025-3-30 15:56
On Deterministic Catalytic Systems (possibly null) string representing a multiset of noncatalyst symbols. (Note that we are only interested in the multiplicities of the symbols.) A catalytic system can be regarded as a . in the following sense. Given an input alphabet Σ consisting of noncatalyst symbols, the system starts with an in作者: chassis 時間: 2025-3-30 19:26
Restricting the Use of Auxiliary Symbols for Restarting Automata restarting automata use auxiliary symbols, and we investigate the influence of these restrictions on their expressive power. In fact, we consider two types of restrictions. First, we consider the . in the tape alphabet of a restarting automaton as a measure of its descriptional complexity. Secondly作者: CLOWN 時間: 2025-3-30 23:23
A Class of Rational ,-WFSM Auto-intersections shown how to compute it via a more simple operation, the auto-intersection. Join and auto-intersection generally do not preserve rationality. We define a class of triples 〈., ., .〉 such that the auto-intersection of the machine . on tapes . and . can be computed by a delay-based algorithm. We point作者: surmount 時間: 2025-3-31 02:46
Experiments with Deterministic ,-Automata for Formulas of Linear Temporal Logicown algorithms to construct a nondeterministic Büchi automaton for the given formula on which we then apply a determinization algorithm. We study here in detail Safra’s determinization algorithm, present several heuristics that attempt to decrease the size of the resulting automata and report on exp作者: curriculum 時間: 2025-3-31 09:05 作者: 譏諷 時間: 2025-3-31 10:10
Tree Automata and XPath on Compressed Treeswhich allow to share identical subtrees in a tree, and straight-line context-free tree grammars, which moreover allow to share identical intermediate parts of a tree. Several completeness results for the classes NL, P, and PSPACE are obtained. Finally, the complexity of the XPath evaluation problem 作者: 提名 時間: 2025-3-31 16:56 作者: 細(xì)查 時間: 2025-3-31 20:30 作者: 鍍金 時間: 2025-3-31 23:29
Antonio Cano,Pedro Garcíang legal theory and network technology, it first discusses the historical development of sovereignty and expounds the legal basis of cyberspace sovereignty. Then, based on the high-performance blockchain, it describes a new network architecture designed to implement co-governance at the technical le作者: single 時間: 2025-4-1 01:56 作者: 表否定 時間: 2025-4-1 09:36
Akio Fujiyoshi,Ikuo Kawaharadaizational opportunities for GDSS use. Based on a classification scheme of organizational problem types and the current technology, a four-cell contingency model was proposed. As the model implies, GDSS should be used with discretion by organizations because the system is presumably useful to help so作者: 婚姻生活 時間: 2025-4-1 12:40
Yo-Sub Han,Derick Woodloping a concrete system, Co-oP, suggests that GDSS should be distributed, loosely-coupled and process-driven. A distributed and loosely-coupled GDSS architecture provides autonomy and flexibility for individual decision-making, and homogeneity and simplicity for group problem solving. Also, process作者: NATTY 時間: 2025-4-1 17:26 作者: collateral 時間: 2025-4-1 18:53 作者: 規(guī)章 時間: 2025-4-1 22:43
