用户名  找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Combinatorics on Words; 14th International C Anna Frid,Robert Mercaş Conference proceedings 2023 The Editor(s) (if applicable) and The Auth

[复制链接]
楼主: 诡计
发表于 2025-3-25 04:59:44 | 显示全部楼层
发表于 2025-3-25 09:00:14 | 显示全部楼层
发表于 2025-3-25 11:44:29 | 显示全部楼层
发表于 2025-3-25 18:35:20 | 显示全部楼层
发表于 2025-3-25 20:16:00 | 显示全部楼层
发表于 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 | 显示全部楼层
发表于 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.
发表于 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 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-31 13:31
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表