作者: echnic 時(shí)間: 2025-3-21 23:28
Automata of asynchronous behaviors,. The applications are: verification of concurrent processes, liveness properties, and delay-insensitivity of asynchronous networks. In all three cases, we start with a common model of a nondeterministic finite automaton, and then add certain application-specific features. Typically, the added featu作者: custody 時(shí)間: 2025-3-22 03:03
LANGAGE: A Maple package for automaton characterization of regular languages, locally testable, or strongly locally testable. New polynomial algorithms are implemented for the two last properties. This package is written using the symbolic computation system Maple. It works with AG, a set of Maple packages for processing automata and finite semigroups.作者: 小畫像 時(shí)間: 2025-3-22 05:08 作者: Mets552 時(shí)間: 2025-3-22 08:48
Implementing WS1S via finite automata: Performance issues,ts critical to its overall performance. This paper explores further some of the topics described in that paper, including minimization, representation of automata, subset construction, and other aspects of the decision procedure. New data will be presented to illustrate how various approaches to the作者: 牽連 時(shí)間: 2025-3-22 14:28 作者: chalice 時(shí)間: 2025-3-22 19:01
Minimal separating sets for Muller automata,s can be replaced by the intersection . ∩ . with a fixed set . of states, provided . is large enough to distinguish between accepting and non-accepting loops in the automaton. We call such a subset . a separating set. Whereas the idea was previously introduced by Mc Naughton [McN93], the algorithmic作者: thrombosis 時(shí)間: 2025-3-22 23:14 作者: 土產(chǎn) 時(shí)間: 2025-3-23 02:13 作者: 終點(diǎn) 時(shí)間: 2025-3-23 09:22 作者: myopia 時(shí)間: 2025-3-23 09:41
Precise estimation of the order of local testability of a deterministic finite automaton, whether or not a word . in the language . depends on (1) the prefix and suffix of the word . of length . - 1 and (2) the set of intermediate substrings of length . of the word .. For given . the language is called .-testable..We give necessary and sufficient conditions for the language of an automa作者: 偏見 時(shí)間: 2025-3-23 16:00
Teaching theory of computation with tape machines,y to the real computer world. The approach is based on a developed software package consisting of a Tape Machine Simulator, a Tape Machine Assembler and a Register Machine Simulator. Using the software and the ideas underlying it the aims of the theory can be achieved without any loss of mathematica作者: Diluge 時(shí)間: 2025-3-23 18:32 作者: 對(duì)手 時(shí)間: 2025-3-24 02:15 作者: 變形詞 時(shí)間: 2025-3-24 05:17 作者: 環(huán)形 時(shí)間: 2025-3-24 09:38
https://doi.org/10.1007/978-3-322-91413-2oose automatically which structure fits best to a given algorithm. This article deals with the foundation of this application, that is, an attempt to standardize the interfaces of a set of different C++ classes implementing an automaton container : ASTL (Automaton Standard Template Library)作者: cocoon 時(shí)間: 2025-3-24 14:03 作者: 著名 時(shí)間: 2025-3-24 16:51
Construction of efficient generalized LR parsers,n-deterministic evolution of the stack instead of graph-structured stack representations, as has often been the case in previous approaches. The algorithm behaves better in practical cases, achieving linear complexity on LR grammars. Experimental results show the performance of our proposal.作者: 果核 時(shí)間: 2025-3-24 20:09
Implementing WS1S via finite automata: Performance issues, of automata, subset construction, and other aspects of the decision procedure. New data will be presented to illustrate how various approaches to the above procedure affect the algorithm‘s performance.作者: GILD 時(shí)間: 2025-3-25 00:09 作者: ambivalence 時(shí)間: 2025-3-25 06:15 作者: 過渡時(shí)期 時(shí)間: 2025-3-25 08:36 作者: APNEA 時(shí)間: 2025-3-25 15:03 作者: thrombus 時(shí)間: 2025-3-25 19:37 作者: 到婚嫁年齡 時(shí)間: 2025-3-25 21:46
Radikal sein in Sachen Gesundheit,arating set of a given size exists is NP-complete. As a step towards an efficient computation of a separating set of minimal size we present an algorithm in the second part of the paper, based on an analysis of the loop structure of the given automaton. An implementation is available.作者: maladorit 時(shí)間: 2025-3-26 01:42
Anleitung zur Blutdruckselbstmessung,two facts: first, the number of grammar rules and, second, the extensive use of generic or “don‘t care” symbols in these rules. We present here the means to directly use rules with the added symbols, leading to a smaller memory usage and a faster implementation.作者: 作嘔 時(shí)間: 2025-3-26 06:34 作者: CRUE 時(shí)間: 2025-3-26 12:03 作者: 劇毒 時(shí)間: 2025-3-26 15:36
Minimal separating sets for Muller automata,arating set of a given size exists is NP-complete. As a step towards an efficient computation of a separating set of minimal size we present an algorithm in the second part of the paper, based on an analysis of the loop structure of the given automaton. An implementation is available.作者: 替代品 時(shí)間: 2025-3-26 17:50 作者: insolence 時(shí)間: 2025-3-26 21:57 作者: overwrought 時(shí)間: 2025-3-27 03:45 作者: Allergic 時(shí)間: 2025-3-27 08:37
Gesundheitsbewegungen in den USAThis paper describes a Prolog implementation of multi-tape finite-state automata and illustrates its use with a rewrite rules system. Operators which are multi-tape specific are defined and algorithms for constructing their behaviour into multi-tape machines are given.作者: INERT 時(shí)間: 2025-3-27 12:45
,Holistic Health — Ganzheitliche Gesundheit,The algorithm that we present here is an adaptation of the automata pseudo- minimization algorithm for finite-state transducer. After giving some definitions, we give an algorithm to build a pseudominimal transducer, that has an interesting property: each recognized word has a proper element.作者: 江湖郎中 時(shí)間: 2025-3-27 13:57 作者: 財(cái)政 時(shí)間: 2025-3-27 18:15
https://doi.org/10.1007/978-3-642-93676-0INTEX is an integrated Natural Language Processing toolbox based on the use of Finite State Transducers (FSTs). It is used to analyse texts of several million words, and includes several large-coverage dictionaries (over one million entries) and grammars. Texts, Dictionaries and Grammars are represented internally by FSTs.作者: FIS 時(shí)間: 2025-3-28 00:12
Multi-tape automata for speech and language systems: A prolog implementation,This paper describes a Prolog implementation of multi-tape finite-state automata and illustrates its use with a rewrite rules system. Operators which are multi-tape specific are defined and algorithms for constructing their behaviour into multi-tape machines are given.作者: 碎片 時(shí)間: 2025-3-28 04:35
Pseudo-minimal transducers: A transducer with proper elements,The algorithm that we present here is an adaptation of the automata pseudo- minimization algorithm for finite-state transducer. After giving some definitions, we give an algorithm to build a pseudominimal transducer, that has an interesting property: each recognized word has a proper element.作者: 歹徒 時(shí)間: 2025-3-28 10:02
Efficient implementation of regular languages using r-AFA,We introduce a bit-wise representation of .-AFA transition functions and describe an efficient implementation method for .-AFA and their operations using this representation. Experiments have shown that this implementation is much more efficient than the Grail DFA implementation in both space and time.作者: 遺留之物 時(shí)間: 2025-3-28 14:20 作者: CURT 時(shí)間: 2025-3-28 15:23
Betriebliches Informationswesen,eneralized LR parsing algorithm working at complexity .(..) in the worst case, which is achieved by the use of dynamic programming to represent the non-deterministic evolution of the stack instead of graph-structured stack representations, as has often been the case in previous approaches. The algor作者: FUSC 時(shí)間: 2025-3-28 20:53
Betriebliches Informationswesen,. The applications are: verification of concurrent processes, liveness properties, and delay-insensitivity of asynchronous networks. In all three cases, we start with a common model of a nondeterministic finite automaton, and then add certain application-specific features. Typically, the added featu作者: Radiculopathy 時(shí)間: 2025-3-29 02:55 作者: 閃光東本 時(shí)間: 2025-3-29 04:10
https://doi.org/10.1007/978-3-658-16564-2 machines. A ligation-based approach allows input of arbitrary length and can be readily implemented with current biotechnology, but requires sequential input feed and different molecules for different machines. In a second implementation not based on ligation, transitions are represented by reusabl作者: accomplishment 時(shí)間: 2025-3-29 07:45 作者: constitutional 時(shí)間: 2025-3-29 15:10 作者: 閑逛 時(shí)間: 2025-3-29 19:07
Radikal sein in Sachen Gesundheit,s can be replaced by the intersection . ∩ . with a fixed set . of states, provided . is large enough to distinguish between accepting and non-accepting loops in the automaton. We call such a subset . a separating set. Whereas the idea was previously introduced by Mc Naughton [McN93], the algorithmic作者: 大喘氣 時(shí)間: 2025-3-29 23:05
https://doi.org/10.1007/978-3-658-09681-6 be modified to target any normal form. The original algorithm and a modification of the algorithm that targets an operator normal form with terminal head and tail are presented. These transformations suggest how a meta-normal form algorithm for context-free grammars could be designed.作者: 開始從未 時(shí)間: 2025-3-29 23:53 作者: Hemoptysis 時(shí)間: 2025-3-30 04:32 作者: novelty 時(shí)間: 2025-3-30 10:27 作者: 收養(yǎng) 時(shí)間: 2025-3-30 16:16 作者: 依法逮捕 時(shí)間: 2025-3-30 18:27
LANGAGE: A Maple package for automaton characterization of regular languages, locally testable, or strongly locally testable. New polynomial algorithms are implemented for the two last properties. This package is written using the symbolic computation system Maple. It works with AG, a set of Maple packages for processing automata and finite semigroups.作者: innovation 時(shí)間: 2025-3-30 21:44 作者: Femish 時(shí)間: 2025-3-31 02:34
An efficient null-free procedure for deciding regular language membership,near in time on the product of the sizes of the expression and of the word, and which does not make use of e-transitions. This procedure is based on a suitable implementation of the Glushkov automaton of the expression. This implementation is computed in linear time and space by the ZPC algorithm designed by Ziadi, Ponty and Champarnaud.作者: 薄膜 時(shí)間: 2025-3-31 06:57
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/166177.jpg作者: enchant 時(shí)間: 2025-3-31 10:32 作者: 想象 時(shí)間: 2025-3-31 16:28
978-3-540-64694-5Springer-Verlag Berlin Heidelberg 1998作者: CHECK 時(shí)間: 2025-3-31 18:37 作者: Iniquitous 時(shí)間: 2025-3-31 23:29 作者: anniversary 時(shí)間: 2025-4-1 02:00 作者: conflate 時(shí)間: 2025-4-1 07:44
https://doi.org/10.1007/978-3-642-93676-0near in time on the product of the sizes of the expression and of the word, and which does not make use of e-transitions. This procedure is based on a suitable implementation of the Glushkov automaton of the expression. This implementation is computed in linear time and space by the ZPC algorithm designed by Ziadi, Ponty and Champarnaud.作者: dandruff 時(shí)間: 2025-4-1 11:55
A rational design for a weighted finite-state transducer library,作者: amplitude 時(shí)間: 2025-4-1 16:54 作者: 郊外 時(shí)間: 2025-4-1 19:23
Precise estimation of the order of local testability of a deterministic finite automaton,y testable automaton with . states: “Is the order of local testability no greater than .(..) when the alphabet size is two?”.Our answer is negative. In the case of size two the situation is the same as in general case: the order of local testability is .(..).作者: 溺愛 時(shí)間: 2025-4-2 01:44
Characterization of the Subsurface Environment on the structure of silica and clay minerals is followed by a description of soil organic matter composition. Consideration of subsurface liquid phase chemistry compares the composition of near solid phase water, affected by the surface properties of the solid phase, to the chemistry of subsurface
