小臼
发表于 2025-3-25 04:59:44
http://reply.papertrans.cn/24/2301/230057/230057_21.png
evaculate
发表于 2025-3-25 09:00:14
http://reply.papertrans.cn/24/2301/230057/230057_22.png
ligature
发表于 2025-3-25 11:44:29
http://reply.papertrans.cn/24/2301/230057/230057_23.png
原来
发表于 2025-3-25 18:35:20
http://reply.papertrans.cn/24/2301/230057/230057_24.png
树上结蜜糖
发表于 2025-3-25 20:16:00
http://reply.papertrans.cn/24/2301/230057/230057_25.png
某人
发表于 2025-3-26 02:34:25
978-3-031-33179-4The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl
范例
发表于 2025-3-26 04:50:26
http://reply.papertrans.cn/24/2301/230057/230057_27.png
玛瑙
发表于 2025-3-26 09:28:20
Minimal Complexities for Infinite Words Written with , LettersIn this extended abstract, we discuss the minimal subword complexity and the minimal abelian complexity functions for infinite .-ary words. This leads us to answer a question of Rauzy from 1983: cubic billiard words are a good generalization of Sturmian words for the abelian complexity.
Esalate
发表于 2025-3-26 13:48:53
On the Number of Distinct Squares in Finite Sequences: Some Old and New Resultsed by Fraenkel and Simpson in 1998. They proved that the number of distinct squares, denoted as ., in a finite word . of length . is upper bounded by 2. and conjectured that . is no larger than .. In this note, we review some old and new findings concerning the square-counting problem and prove that ..
发起
发表于 2025-3-26 20:35:15
http://reply.papertrans.cn/24/2301/230057/230057_30.png