作者: Coronary 時間: 2025-3-21 20:34 作者: 荒唐 時間: 2025-3-22 02:53 作者: defuse 時間: 2025-3-22 05:20 作者: Ambiguous 時間: 2025-3-22 12:02
Operations on DASG,ng a state on the right, deleting a state on the right, adding an inner state, deleting an inner state and replacing a transition label. For each of these operations we describe the modification of DASG and the proof of correctness.作者: intolerance 時間: 2025-3-22 15:12
A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs,ess arguments) from two separate algorithms, one for minimization and one for adding words to acyclic automata. The algorithms are derived in such a way as to be combinable, yielding a semi-incremental one. In practice, the algorithm is both easy to implement and displays good running time performance.作者: cataract 時間: 2025-3-22 19:14 作者: Kidney-Failure 時間: 2025-3-23 00:47 作者: Nutrient 時間: 2025-3-23 04:40
,The Finite State Automata’s Design Patterns,omata, simply customizing some classes. In order to test the framework, some concrete lexical tools have been created. The resulting automata and transducers are used to perform word form analysis, word form generation, creation and derivation history, spellchecking and phrase recognition.作者: LVAD360 時間: 2025-3-23 08:22
https://doi.org/10.1007/978-3-662-36983-8output in such positions, we obtain an extended parser for the .(.)-grammar .. Given an arbitrary .(.)-grammar ., we will show how to construct an extended parser of polynomial size manipulating at most . . pointers.作者: chemoprevention 時間: 2025-3-23 11:14
https://doi.org/10.1007/978-3-662-36981-4 a given DFA accepting a finite language, constructs a minimal deterministic finite coverautomaton of the language. We also give algorithms for the boolean operations on deterministic cover automata, i.e., on the finite languages they represent.作者: Airtight 時間: 2025-3-23 15:08
https://doi.org/10.1007/978-3-642-49883-1ng a state on the right, deleting a state on the right, adding an inner state, deleting an inner state and replacing a transition label. For each of these operations we describe the modification of DASG and the proof of correctness.作者: Water-Brash 時間: 2025-3-23 20:15
Einleitung. Wert der Gesundheitspflege,ess arguments) from two separate algorithms, one for minimization and one for adding words to acyclic automata. The algorithms are derived in such a way as to be combinable, yielding a semi-incremental one. In practice, the algorithm is both easy to implement and displays good running time performance.作者: semiskilled 時間: 2025-3-24 00:14 作者: Chandelier 時間: 2025-3-24 05:51 作者: apropos 時間: 2025-3-24 08:49
,Unfallverhütung im Kindesalter,omata, simply customizing some classes. In order to test the framework, some concrete lexical tools have been created. The resulting automata and transducers are used to perform word form analysis, word form generation, creation and derivation history, spellchecking and phrase recognition.作者: 異端邪說下 時間: 2025-3-24 14:05
0302-9743 at the U- versity of Rouen, France. Automata theory is the cornerstone of computer science theory. While there is much practical experience with using automata, this work covers diverse - eas,includingparsing,computationallinguistics,speechrecognition,textsear- ing,device controllers,distributed sys作者: 教義 時間: 2025-3-24 14:57
https://doi.org/10.1007/978-3-662-36983-8nces. We prove the correctness and linear complexity of our algorithm and present an interesting extension of our substring parser that allows to condense the input string, which increases the speed when reparsing that string for a second time.作者: Defiance 時間: 2025-3-24 19:32 作者: Nibble 時間: 2025-3-25 02:12
https://doi.org/10.1007/978-3-658-29852-4 programs as possible semantics. We discuss the encapsulation property which emerges in such systems and give precise description of the syntax, operational and denotational semantics in terms of Category Theory. A data structure capable to meet the requirements of a graph-based computational environment is sketched at the end.作者: Subjugate 時間: 2025-3-25 04:53 作者: 頂點 時間: 2025-3-25 07:59 作者: 水槽 時間: 2025-3-25 13:07 作者: 繁榮地區(qū) 時間: 2025-3-25 16:23
Conference proceedings 1999versity of Rouen, France. Automata theory is the cornerstone of computer science theory. While there is much practical experience with using automata, this work covers diverse - eas,includingparsing,computationallinguistics,speechrecognition,textsear- ing,device controllers,distributed systems, andp作者: 惡臭 時間: 2025-3-25 22:44 作者: Accede 時間: 2025-3-26 03:27 作者: 輕彈 時間: 2025-3-26 05:12
Extended Context-Free Grammars and Normal Form Algorithms,mar. Our results generalize known bounds for context-free grammars but do so in nontrivial ways. Specifically, we introduce a new representation scheme for extended context-free grammars (the symbol-threaded expression forest), a new normal form for these grammars (dot normal form) and new regular expression algorithms.作者: Psa617 時間: 2025-3-26 10:32
Implementing Reversed Alternating Finite Automaton (r-AFA) Operations, in [.]. Experiments show that the new algorithms can significantly reduce the state size of the resulting r- AFA. We also show how we have improved the DFA-to-AFA transformation algorithm which was described in [.]. The average run time of this transformation using the modified algorithm has improved significantly (by 97 percent).作者: Infraction 時間: 2025-3-26 14:45
Extended Context-Free Grammars and Normal Form Algorithms,f right-hand sides for each nonterminal in such a grammar is a regular set. The study is motivated by the implementation project GraMa which will provide a C++ toolkit for the symbolic manipulation of context-free objects just as Grail does for regular objects. The results are that all transformatio作者: 注入 時間: 2025-3-26 17:41 作者: handle 時間: 2025-3-27 00:01 作者: AND 時間: 2025-3-27 02:00
Minimal Cover-Automata for Finite Languages,rd in .. A minimal deterministic cover automaton of a finite language . usually has a smaller size than a minimal DFA that accept .. Thus, cover automata can be used to reduce the size of the representations of finite languages in practice. In this paper, we describe an efficient algorithm that, for作者: Emg827 時間: 2025-3-27 09:18
Implementing Reversed Alternating Finite Automaton (r-AFA) Operations,ibed our algorithms and implementation methods for the union, intersection, and complementation of r-AFA. However, our direct algorithms for the star, concatenation, and reversal operations of r- AFA would cause an exponential expansion in the size of resulting r-AFA for even the average cases. In t作者: 含糊其辭 時間: 2025-3-27 13:08 作者: 被詛咒的人 時間: 2025-3-27 15:28 作者: 過度 時間: 2025-3-27 19:55 作者: intrigue 時間: 2025-3-28 00:52 作者: cliche 時間: 2025-3-28 05:51 作者: 安心地散步 時間: 2025-3-28 06:29
Proving Sequential Function Chart Programs Using Automata,physical time can be handled by SFC programs using temporisations, that’s why we are interested in the quantitative temporal properties. We have proposed a modeling of SFC in timed automata, a formalism which takes time into account. In this modeling, we use the physical constraints of the environme作者: 放肆的我 時間: 2025-3-28 10:52
Automata and Computational Probabilities, associated formal series, are the basic theoretical tool for representing experiments, and for solving probability problems. Starting from a description of a random experiment given as a special kind of regular expressions, the environment constructs automata from which it extracts generating serie作者: Aqueous-Humor 時間: 2025-3-28 18:23 作者: nascent 時間: 2025-3-28 19:33
On the Syntax, Semantics, and Implementation of a Graph-Based Computational Environment,tics. From the variety of possibilities we concentrate on graphs and polynets as possible carriers of the syntax, and finite automata and flow-diagram programs as possible semantics. We discuss the encapsulation property which emerges in such systems and give precise description of the syntax, opera作者: HARP 時間: 2025-3-29 01:43
,The Finite State Automata’s Design Patterns,f a framework for the implementation of FSA will be treated, presenting not only the patterns for the single components, but the entire system design. Using design patterns to sketch a framework means performing an ”abstract implementation”, from which it is possible to realize concrete specific aut作者: 野蠻 時間: 2025-3-29 05:34
Automata Implementation978-3-540-48057-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Vertebra 時間: 2025-3-29 11:15
Vorkenntnisse zur Krankenpflege,aton and the second one is the simulation of the run of .. In this paper we discuss the second way. We present an overview of the simulation methods that have been found in the approximate string matching. We generalize these simulation methods and form the rules for the usage of these methods.作者: Serenity 時間: 2025-3-29 15:27
https://doi.org/10.1007/978-3-662-36984-5ta enriched with notions of proximity, optionality and contextual information. They are called bi-directional because they need to parse a sequence not only from the left to right-hand side of a sentence, but on both sides of a word. This method improves efficiency.作者: 細(xì)菌等 時間: 2025-3-29 17:24 作者: 遍及 時間: 2025-3-29 19:56 作者: 宣誓書 時間: 2025-3-30 02:55 作者: Additive 時間: 2025-3-30 07:34
Automata and Computational Probabilities, associated formal series, are the basic theoretical tool for representing experiments, and for solving probability problems. Starting from a description of a random experiment given as a special kind of regular expressions, the environment constructs automata from which it extracts generating series associated to the experiment.作者: Myosin 時間: 2025-3-30 10:03 作者: PSA-velocity 時間: 2025-3-30 13:55 作者: 偽造 時間: 2025-3-30 17:52
https://doi.org/10.1007/978-3-662-36979-1We show that the concept of automata minimization leads to a nice interpretation of the famous canonicity of binary decision diagrams discovered by Bryant.作者: 放逐 時間: 2025-3-31 00:09
Integratives Gesundheitscoaching,We present here theoretical results coming from the implementation of the package called AMULT (automata with multiplicities in several noncommutative variables). We show that classical formulas are “almost every time” optimal and characterize the dual laws preserving rationality.作者: cajole 時間: 2025-3-31 04:26
Determinization of Glushkov Automata,We establish a new upper bound on the number of states of the automaton yielded by the determinization of a Glushkov automaton. We show that the ZPC structure, which is an implicit construction for Glushkov automata, leads to an efficient implementation of the subset construction.作者: 取消 時間: 2025-3-31 08:55 作者: glucagon 時間: 2025-3-31 12:52
Automata and Binary Decision Diagrams,We show that the concept of automata minimization leads to a nice interpretation of the famous canonicity of binary decision diagrams discovered by Bryant.作者: Magisterial 時間: 2025-3-31 13:45
Operations over Automata with Multiplicities,We present here theoretical results coming from the implementation of the package called AMULT (automata with multiplicities in several noncommutative variables). We show that classical formulas are “almost every time” optimal and characterize the dual laws preserving rationality.作者: IST 時間: 2025-3-31 21:19 作者: companion 時間: 2025-4-1 01:00 作者: inferno 時間: 2025-4-1 04:32
