inconceivable
发表于 2025-3-28 18:39:11
http://reply.papertrans.cn/17/1663/166226/166226_41.png
LIEN
发表于 2025-3-28 20:19:48
0302-9743 salem in July 1994. ICALP is an annual conference sponsored by the European Association on Theoretical Computer Science (EATCS). The proceedings contains 48 refereed papers selected from 154 submissions and 4 invited papers. The papers cover the whole range of theoretical computer science; they are
charisma
发表于 2025-3-29 02:58:14
Die bauliche Anlage der Fabrik (Werkstätten)n regular expressions and contextfree grammars, or for defining outer measures on the space of .-words which are of some importance for the theory of fractals. These connections yield new formulae to determine the Hausdorff dimension of fractal sets (especially in Euclidean spaces) defined via regular expressions and contextfree grammars.
Psa617
发表于 2025-3-29 06:10:30
http://reply.papertrans.cn/17/1663/166226/166226_44.png
Basal-Ganglia
发表于 2025-3-29 10:36:07
http://reply.papertrans.cn/17/1663/166226/166226_45.png
monochromatic
发表于 2025-3-29 12:17:30
http://reply.papertrans.cn/17/1663/166226/166226_46.png
Externalize
发表于 2025-3-29 19:28:24
Valuations and unambiguity of languages, with applications to fractal geometry,n regular expressions and contextfree grammars, or for defining outer measures on the space of .-words which are of some importance for the theory of fractals. These connections yield new formulae to determine the Hausdorff dimension of fractal sets (especially in Euclidean spaces) defined via regular expressions and contextfree grammars.
affinity
发表于 2025-3-29 19:53:57
On some relations between dynamical systems and transition systems,e reachability problem for such systems is undecidable for 3 dimensions. A decision procedure for 2-dimensional systems has been recently reported by Maler and Pnueli. On the other hand we show that some non-deterministic finite automata cannot be realized by any continuous dynamical system with less than 3 dimensions.
油毡
发表于 2025-3-30 00:42:00
http://reply.papertrans.cn/17/1663/166226/166226_49.png
灰心丧气
发表于 2025-3-30 04:40:36
Optimal parallel algorithms for Prefix Matching,rawn from an alphabet set of size polynomial in ., where . and .; it takes .(log .) time, .(..+..) space, and does . work, for any .>0. The second algorithm works for unbounded alphabet sets and takes .(log..(log log .).) time, .(m + n) space, and does . work. These are the first known work-optimal algorithms for this problem.