neologism
发表于 2025-3-23 12:40:34
,On the Simon’s Congruence Neighborhood of Languages,ost .. We extend Simon’s congruence to languages. First, we define the Simon’s congruence neighborhood of a language . to be a set of strings that have a .-congruent string in .. Next, we define two languages . and . to be .-congruent if both have the same Simon’s congruence neighborhood. We prove t
有说服力
发表于 2025-3-23 16:06:43
Tree-Walking-Storage Automata,ized stack automata, where the linear stack storage is replaced by a non-linear tree-like stack. Therefore, tree-walking-storage automata have the ability to explore the interior of the tree storage without altering the contents, where the possible moves of the tree pointer correspond to those of tr
Liberate
发表于 2025-3-23 18:05:58
http://reply.papertrans.cn/28/2703/270238/270238_13.png
吃掉
发表于 2025-3-23 22:12:09
http://reply.papertrans.cn/28/2703/270238/270238_14.png
有害处
发表于 2025-3-24 04:37:57
,Languages Generated by Conjunctive Query Fragments of FC, conjunctive query fragments, . and .. We compare the expressive power of . to that of various related language generators, such as regular expressions, patterns, and typed patterns. We then consider decision problems for . and ., and show that certain static analysis problems (such as equivalence a
改变
发表于 2025-3-24 08:26:14
http://reply.papertrans.cn/28/2703/270238/270238_16.png
Forehead-Lift
发表于 2025-3-24 14:24:32
http://reply.papertrans.cn/28/2703/270238/270238_17.png
overbearing
发表于 2025-3-24 15:32:15
http://reply.papertrans.cn/28/2703/270238/270238_18.png
CLOT
发表于 2025-3-24 20:41:03
,On the Simon’s Congruence Neighborhood of Languages,hat it is .-complete to check .-congruence of two regular languages and decidable up to recursive languages. Moreover, we tackle the problem of computing the maximum . that makes two given languages .-congruent. This problem is .-complete for two regular languages, and undecidable for context-free languages.
我没有强迫
发表于 2025-3-25 03:09:37
,Approaching Repetition Thresholds via Local Resampling and Entropy Compression,pected from a purely information-theoretic considerations. In the second part, we present experimental results obtained by the mentioned algorithm in the extreme case of .-ary words avoiding .-powers.