作者: 話 時間: 2025-3-21 20:24 作者: 一個姐姐 時間: 2025-3-22 00:44 作者: acheon 時間: 2025-3-22 06:43 作者: Accomplish 時間: 2025-3-22 12:44 作者: synovium 時間: 2025-3-22 15:38
0302-9743 Overview: Includes supplementary material: 978-3-540-42812-1978-3-540-45526-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: harbinger 時間: 2025-3-22 18:00
Susanne Krugmann,Bernhard Borgetton the context of Constraint Satisfaction Problems, widely used in AI. We first give some complexity results which are based on the strong relationship with covering problems of bipartite graphs. We then use these coverings as a basic tool for the definition of minimization heuristics, and describe some experimental results.作者: 整潔 時間: 2025-3-23 00:46 作者: cringe 時間: 2025-3-23 03:02
Gesundheitsf?rderung durch soziale Netzwerkeach is eclectic in the sense that various complementary methods have been employed: row-indexed storage of sparse matrices, dictionary compression, bit manipulation, and lossless omission of data. The compression rate is over 83% with respect to the current Bell Labs finite-state library.作者: slipped-disk 時間: 2025-3-23 08:11
FA Minimisation Heuristics for a Class of Finite Languages,n the context of Constraint Satisfaction Problems, widely used in AI. We first give some complexity results which are based on the strong relationship with covering problems of bipartite graphs. We then use these coverings as a basic tool for the definition of minimization heuristics, and describe some experimental results.作者: arcane 時間: 2025-3-23 13:21 作者: BRAND 時間: 2025-3-23 13:52 作者: 耐寒 時間: 2025-3-23 19:28
https://doi.org/10.1007/3-540-45526-4Automat; Automata; Automata Theory; Cellular Automata; Finite Automata; Finite Languages; Finite-State Sys作者: 朦朧 時間: 2025-3-24 00:21
978-3-540-42812-1Springer-Verlag Berlin Heidelberg 2001作者: debase 時間: 2025-3-24 02:52
Susanne Krugmann,Bernhard Borgetton the context of Constraint Satisfaction Problems, widely used in AI. We first give some complexity results which are based on the strong relationship with covering problems of bipartite graphs. We then use these coverings as a basic tool for the definition of minimization heuristics, and describe s作者: ATP861 時間: 2025-3-24 08:43 作者: 比目魚 時間: 2025-3-24 13:32 作者: 充氣球 時間: 2025-3-24 17:36 作者: 提煉 時間: 2025-3-24 22:23 作者: CT-angiography 時間: 2025-3-25 03:10
https://doi.org/10.1007/978-3-658-35603-3atization), or morphological categories (in tagging), or both. Some of them find their ways into dictionaries, and it would be nice to predict what their entries should look like. Humans can perform those tasks using endings of words (sometimes prefixes and infixes as well), and so can do computers.作者: N防腐劑 時間: 2025-3-25 06:26
Gesundheitsf?rderung an der Universit?ton and Hausdorff dimension of the encoded image. Jürgensen and Staiger [.] proposed a method by which the local Hausdorff dimension of the encoded image could be effectively computed. This paper describes the first implementation of this procedure and presents some experimental results showing local作者: 路標(biāo) 時間: 2025-3-25 10:43
Gesundheitsf?rderung an der Universit?trlying digraph of a Thompson machine a Thompson digraph. We establish and prove a characterization of Thompson digraphs. As one application of the characterization, we give an algorithm that generates an equivalent regular expression from a Thompson machine in time linear in the number of states.作者: BET 時間: 2025-3-25 12:55 作者: Needlework 時間: 2025-3-25 19:36 作者: 斷言 時間: 2025-3-25 20:11 作者: FOVEA 時間: 2025-3-26 03:48 作者: conduct 時間: 2025-3-26 06:08 作者: connoisseur 時間: 2025-3-26 12:10 作者: Pruritus 時間: 2025-3-26 14:20 作者: Carbon-Monoxide 時間: 2025-3-26 18:07
Rahim Hajji,Katharina Kitze,Nadine Piecknd 2. when . is odd. Results for alphabets of an arbitrary size are also obtained. These upper-bounds for finite languages are strictly lower than the corresponding ones for general regular languages.作者: 法官 時間: 2025-3-26 21:01 作者: 不安 時間: 2025-3-27 01:47 作者: Arboreal 時間: 2025-3-27 07:13 作者: 討好女人 時間: 2025-3-27 09:47
Rahim Hajji,Katharina Kitze,Nadine Pieckitions and algorithms are presented in graphically appealing form. Animations show how finite automata are created from regular expressions, as well as, how finite automata work. We discuss principles used throughout the design of the software and give some preliminary results of evaluations of the software and discuss related work.作者: decode 時間: 2025-3-27 13:40 作者: GORGE 時間: 2025-3-27 18:51
Animation of the Generation and Computation of Finite Automata for Learning Software,itions and algorithms are presented in graphically appealing form. Animations show how finite automata are created from regular expressions, as well as, how finite automata work. We discuss principles used throughout the design of the software and give some preliminary results of evaluations of the software and discuss related work.作者: 補角 時間: 2025-3-28 01:44
A Taxonomy of Algorithms for Constructing Minimal Acyclic Deterministic Finite Automata,ession or minimization..The taxonomization method arrives at all of the known algorithms, and some which are likely new ones (though proper attribution is not attempted, since the algorithms are usually of commercial value and some secrecy frequently surrounds the identities of the original authors).作者: compose 時間: 2025-3-28 05:12
https://doi.org/10.1007/978-3-658-35603-3Brill’s one, lack speed, both in the rule acquisition phase, and in the rule application phase. Their algorithms handle only the case of tagging, although an extension to other tasks seems possible. We propose a very fast finite-state method that handles all of the tasks described above, and that achieves similar quality of guessing.作者: 使更活躍 時間: 2025-3-28 08:22
Gesundheitsf?rderung für kleine Unternehmend number of components can generate the permutation closures of all recursively enumerable languages, and (3) the obtained family is a full AFL. Result (2) is related to a possible (speculative) implementation of our systems in biochemical media.作者: jeopardize 時間: 2025-3-28 13:15
Von der Suchtpr?vention zur Drogenmündigkeit of compacted outputs there is no reduction of the fault coverage for a pseudo-random off-line test. Since the proposed algorithm is of linear complexity with respect to the number of circuit lines and of quadratic complexity with respect to the number of primary circuit outputs large automata can be efficiently processed.作者: enflame 時間: 2025-3-28 14:43
Treatment of Unknown Words,Brill’s one, lack speed, both in the rule acquisition phase, and in the rule application phase. Their algorithms handle only the case of tagging, although an extension to other tasks seems possible. We propose a very fast finite-state method that handles all of the tasks described above, and that achieves similar quality of guessing.作者: 好忠告人 時間: 2025-3-28 20:30 作者: bronchiole 時間: 2025-3-29 01:00
A Structural Method for Output Compaction of Sequential Automata Implemented as Circuits, of compacted outputs there is no reduction of the fault coverage for a pseudo-random off-line test. Since the proposed algorithm is of linear complexity with respect to the number of circuit lines and of quadratic complexity with respect to the number of primary circuit outputs large automata can be efficiently processed.作者: 我不明白 時間: 2025-3-29 04:01
https://doi.org/10.1007/978-3-658-35603-3simple and efficient representation of the states of an automaton that recognizes the behaviors of the process. This representation is based on a mechanical structure which helps us encode the states in a compact manner and leads to simple algorithms.作者: ordain 時間: 2025-3-29 09:21 作者: 叫喊 時間: 2025-3-29 12:08 作者: inundate 時間: 2025-3-29 18:15
Gesundheitsf?rderung im Setting Schule the sets of substrings occurring . times are the same, for . ≤ .. For given . and . the language is called .-threshold ktestable. A finite deterministic automaton is called .-threshold .-testable.New version of polynomial time algorithm to verify the local testability will be presented too.作者: Minuet 時間: 2025-3-29 23:03
Analysis of Reactive Systems with , Timers,simple and efficient representation of the states of an automaton that recognizes the behaviors of the process. This representation is based on a mechanical structure which helps us encode the states in a compact manner and leads to simple algorithms.作者: Goblet-Cells 時間: 2025-3-30 02:46 作者: 冰河期 時間: 2025-3-30 07:53 作者: ARC 時間: 2025-3-30 10:42
An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata, the sets of substrings occurring . times are the same, for . ≤ .. For given . and . the language is called .-threshold ktestable. A finite deterministic automaton is called .-threshold .-testable.New version of polynomial time algorithm to verify the local testability will be presented too.作者: 惡臭 時間: 2025-3-30 12:31 作者: impaction 時間: 2025-3-30 17:32 作者: 的事物 時間: 2025-3-30 22:34
FA Minimisation Heuristics for a Class of Finite Languages,n the context of Constraint Satisfaction Problems, widely used in AI. We first give some complexity results which are based on the strong relationship with covering problems of bipartite graphs. We then use these coverings as a basic tool for the definition of minimization heuristics, and describe s作者: Parabola 時間: 2025-3-31 01:20
Analysis of Reactive Systems with , Timers,ls are equally adapted to numerical calculations as to symbolical ones, thus allowing for parametric analysis. The results we have obtained rely on a simple and efficient representation of the states of an automaton that recognizes the behaviors of the process. This representation is based on a mech作者: 絕食 時間: 2025-3-31 06:21
Animation of the Generation and Computation of Finite Automata for Learning Software, not suffice. We have developed a learning software, that helps the learner to better understand principles of compiler construction, in particular lexical analysis. The software offers on the one hand an interactive introduction to the problems of lexical analysis, in which the most important defin作者: Camouflage 時間: 2025-3-31 11:16
Metric Lexical Analysis,at every additive quasi-distance is regularitypreserving, that is, the neighborhood of any radius of a regular language with respect to an additive quasi-distance is regular. As an application we present a simple algorithm that constructs a metric (fault-tolerant) lexical analyzer for any given lexi作者: anarchist 時間: 2025-3-31 14:14 作者: Collected 時間: 2025-3-31 20:53
Treatment of Unknown Words,atization), or morphological categories (in tagging), or both. Some of them find their ways into dictionaries, and it would be nice to predict what their entries should look like. Humans can perform those tasks using endings of words (sometimes prefixes and infixes as well), and so can do computers.作者: 不要不誠實 時間: 2025-4-1 00:39
Computing Entropy Maps of Finite-Automaton-Encoded Binary Images,on and Hausdorff dimension of the encoded image. Jürgensen and Staiger [.] proposed a method by which the local Hausdorff dimension of the encoded image could be effectively computed. This paper describes the first implementation of this procedure and presents some experimental results showing local作者: Harbor 時間: 2025-4-1 02:30
Thompson Digraphs: A Characterization,rlying digraph of a Thompson machine a Thompson digraph. We establish and prove a characterization of Thompson digraphs. As one application of the characterization, we give an algorithm that generates an equivalent regular expression from a Thompson machine in time linear in the number of states.
