Arthr-
发表于 2025-3-23 11:29:09
http://reply.papertrans.cn/23/2299/229891/229891_11.png
flaggy
发表于 2025-3-23 14:57:05
Natural Disease May Mimic Child Abuse,A clean version of Weiner’s linear-time compact-subword-tree construction simultaneously also constructs the smallest deterministic finite automaton recognizing the . subwords.
helper-T-cells
发表于 2025-3-23 19:23:26
http://reply.papertrans.cn/23/2299/229891/229891_13.png
TSH582
发表于 2025-3-23 22:19:53
Open Problems in StringologySeveral open problems concerning combinatorial algorithms on strings are described.
Constitution
发表于 2025-3-24 05:30:20
The Myriad Virtues of Subword TreesSeveral nontrivial applications of subword trees have been developed since their first appearance. Some such applications depart considerably from the original motivations. A brief account of them is attempted here.
TAP
发表于 2025-3-24 07:29:37
http://reply.papertrans.cn/23/2299/229891/229891_16.png
Permanent
发表于 2025-3-24 14:02:55
Optimal Parsing of StringsParsing of strings has been suggested by Lempel and Ziv, as a tool to define the complexity of strings and to compress them . Recently, they have shown that the scheme may be modified to handle two dimensional data .
temperate
发表于 2025-3-24 16:23:49
Optimal Factor Transducersf each others, In this paper we show that automata theory unifies the two approaches and sives a simple and efficient alsorithm to construct the structure, a sequential transducer, underlyins Weiner’s method.
Chagrin
发表于 2025-3-24 21:34:43
Novel Compression of Sparse Bit-Strings — Preliminary Report zero-block runs are represented. The basis elements of these systems, together with the non-zero blocks, are assigned Huffman codes. Experiments run on bit-maps of the Responsa Retrieval Project, and for comparison on randomly generated maps and on a digitized picture, yield compressions superior to previously known methods.
Incisor
发表于 2025-3-25 02:32:52
The Use and Usefulness of Numeration Systemsl group theory, compression of sparse binary strings, encoding of contiguous binary strings of unknown lengths, ranking of permutations and combinations, strategies of games and other examples. Two abstract counting systems are given from which the concrete ones used for the applications can be derived.