找回密码
 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

[复制链接]
查看: 52631|回复: 61
发表于 2025-3-21 18:36:54 | 显示全部楼层 |阅读模式
书目名称Combinatorics on Words
副标题14th International C
编辑Anna Frid,Robert Mercaş
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Combinatorics on Words; 14th International C Anna Frid,Robert Mercaş Conference proceedings 2023 The Editor(s) (if applicable) and The Auth
描述This book constitutes the refereed proceedings of the 14th International Conference on Combinatorics on Words, WORDS 2023, held in Umeå, Sweden, during June 12–16, 2023..The 19 contributed papers presented in this book were carefully reviewed and selected from 28 submissions. In addition, the volume also contains 3 invited papers. WORDS  is the main conference series devoted to combinatorics on words. This area is connected to several topics from computer science and mathematics, including string algorithms, automated proofs, discrete dynamics, number theory and, of course, classical combinatorics.
出版日期Conference proceedings 2023
关键词combinatorics on words; repetitions; automatic theorem-proving; Arnoux-Rauzy words; pattern matching; abe
版次1
doihttps://doi.org/10.1007/978-3-031-33180-0
isbn_softcover978-3-031-33179-4
isbn_ebook978-3-031-33180-0Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightThe Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl
The information of publication is updating

书目名称Combinatorics on Words影响因子(影响力)




书目名称Combinatorics on Words影响因子(影响力)学科排名




书目名称Combinatorics on Words网络公开度




书目名称Combinatorics on Words网络公开度学科排名




书目名称Combinatorics on Words被引频次




书目名称Combinatorics on Words被引频次学科排名




书目名称Combinatorics on Words年度引用




书目名称Combinatorics on Words年度引用学科排名




书目名称Combinatorics on Words读者反馈




书目名称Combinatorics on Words读者反馈学科排名




单选投票, 共有 1 人参与投票
 

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

1票 100.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 23:19:04 | 显示全部楼层
发表于 2025-3-22 02:31:06 | 显示全部楼层
发表于 2025-3-22 07:31:17 | 显示全部楼层
发表于 2025-3-22 10:38:13 | 显示全部楼层
发表于 2025-3-22 15:51:55 | 显示全部楼层
String Attractors of Fixed Points of ,-Bonacci-Like Morphismss. In this paper, we obtain string attractors of prefixes of particular infinite words generalizing .-bonacci words (including the famous Fibonacci word) and obtained as fixed points of .-bonacci-like morphisms. In fact, our description involves the numeration systems classically derived from the considered morphisms.
发表于 2025-3-22 20:34:27 | 显示全部楼层
发表于 2025-3-23 00:24:39 | 显示全部楼层
Conference proceedings 2023 also contains 3 invited papers. WORDS  is the main conference series devoted to combinatorics on words. This area is connected to several topics from computer science and mathematics, including string algorithms, automated proofs, discrete dynamics, number theory and, of course, classical combinatorics.
发表于 2025-3-23 02:42:40 | 显示全部楼层
发表于 2025-3-23 08:49:31 | 显示全部楼层
Conference proceedings‘‘‘‘‘‘‘‘ 2021 of deterministic automata with output, which are known to characterize automatic sequences. More precisely, we investigate magic numbers for periodic sequences viewed as either automatic, regular, or constant-recursive.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-2 20:46
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表