咨询与建议

限定检索结果

文献类型

  • 318 篇 期刊文献
  • 64 篇 会议
  • 12 篇 学位论文

馆藏范围

  • 394 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 273 篇 工学
    • 269 篇 计算机科学与技术...
    • 25 篇 软件工程
    • 5 篇 电气工程
    • 2 篇 信息与通信工程
    • 2 篇 控制科学与工程
    • 1 篇 网络空间安全
  • 182 篇 理学
    • 178 篇 数学
    • 4 篇 物理学
    • 2 篇 统计学(可授理学、...
    • 1 篇 生物学
    • 1 篇 系统科学
    • 1 篇 科学技术史(分学科...
  • 34 篇 管理学
    • 34 篇 管理科学与工程(可...
    • 1 篇 工商管理
  • 7 篇 文学
    • 7 篇 外国语言文学
  • 2 篇 艺术学
    • 2 篇 音乐与舞蹈学
  • 1 篇 经济学
    • 1 篇 应用经济学
  • 1 篇 法学
    • 1 篇 法学
  • 1 篇 农学

主题

  • 394 篇 combinatorics on...
  • 43 篇 partial words
  • 29 篇 morphisms
  • 18 篇 repetitions
  • 18 篇 periodicity
  • 17 篇 sturmian words
  • 16 篇 formal languages
  • 13 篇 symbolic dynamic...
  • 13 篇 word equations
  • 9 篇 palindromes
  • 9 篇 subword complexi...
  • 9 篇 automata and for...
  • 9 篇 automatic sequen...
  • 8 篇 rich words
  • 8 篇 thue-morse word
  • 8 篇 squares
  • 8 篇 overlap-free wor...
  • 8 篇 ambiguity
  • 8 篇 lyndon words
  • 8 篇 k-abelian equiva...

机构

  • 28 篇 univ n carolina ...
  • 14 篇 univ winnipeg de...
  • 14 篇 univ waterloo sc...
  • 13 篇 univ turku dept ...
  • 11 篇 univ n carolina ...
  • 10 篇 univ western ont...
  • 10 篇 univ palermo dip...
  • 8 篇 sobolev inst mat...
  • 6 篇 univ turku dept ...
  • 6 篇 univ kiel dept c...
  • 6 篇 univ kiel dept c...
  • 6 篇 univ palermo dip...
  • 5 篇 univ calif los a...
  • 5 篇 charles universi...
  • 5 篇 moscow mv lomono...
  • 4 篇 univ waterloo de...
  • 4 篇 univ liege dept ...
  • 4 篇 kings coll londo...
  • 4 篇 tech univ kaiser...
  • 4 篇 tu dortmund dept...

作者

  • 34 篇 blanchet-sadri f...
  • 14 篇 mercas robert
  • 14 篇 manea florin
  • 13 篇 nowotka dirk
  • 12 篇 saarela aleksi
  • 11 篇 shallit jeffrey
  • 11 篇 holub stepan
  • 10 篇 fici gabriele
  • 10 篇 harju t
  • 10 篇 richomme g
  • 9 篇 badkobeh golnaz
  • 8 篇 nowotka d
  • 8 篇 crochemore maxim...
  • 8 篇 restivo antonio
  • 8 篇 reidenbach danie...
  • 7 篇 liptak zsuzsanna
  • 7 篇 ochem pascal
  • 7 篇 rigo michel
  • 6 篇 rampersad narad
  • 6 篇 bell jason p.

语言

  • 346 篇 英文
  • 48 篇 其他
检索条件"主题词=combinatorics on words"
394 条 记 录,以下是1-10 订阅
排序:
combinatorics on words and generating Dirichlet series of automatic sequences
收藏 引用
DISCRETE MATHEMATICS 2025年 第8期348卷
作者: Allouche, Jean-Paul Shallit, Jeffrey Stipulanti, Manon Sorbonne CNRS IMJ PRG Paris France Univ Waterloo Sch Comp Sci Waterloo ON Canada ULiege Dept Math Liege Belgium
Generating series are crucial in enumerative combinatorics, analytic combinatorics, and combinatorics on words. Though it might seem at first view that generating Dirichlet series are less used in these fields than or... 详细信息
来源: 评论
combinatorics on words in Symbolic Dynamics:The Quadratic Map
收藏 引用
Acta Mathematica Sinica,English Series 2008年 第12期24卷 1985-1994页
作者: Wan Ji DAI Kebo LU Jun WANG Department of Applied Mathematics Dalian University of Technology Dalian 116024 P. R. China Department of Mathematics Ocean University of China Qingdao 266071 P. R. China Department of Mathematics Shanghai Normal University Shanghai 200234 P. R. China Scientific Computing Key Laboratory Shanghai Universities Shanghai 200234 P. R. China
This paper is contributed to the combinatorial properties of the MSS sequences, which are the periodic kneading words of quadratic maps defined on a interval. An explicit expression of adjacency relations on MSS seque... 详细信息
来源: 评论
combinatorics on words in Symbolic Dynamics:the Antisymmetric Cubic Map
收藏 引用
Acta Mathematica Sinica,English Series 2008年 第11期24卷 1817-1834页
作者: Wan Ji DAI Kebo LU Jun WANG Dalian University of Technology Dalian 116024 P. R. China Department of Mathematics Ocean University of China Qingdao 266071 P. R. China Department of Mathematics Shanghai Normal University Shanghai 200234 P. R. China Scientific Computing Key Laboratory Shanghai Universities Shanghai 200234 P. R. China
This paper is contributed to the combinatorial properties of the periodic kneading words of antisymmetric cubic maps defined on a interval. The least words of given lengths, the adjacency relations on the words of giv... 详细信息
来源: 评论
The Join of the Varieties of R-trivial and L-trivial Monoids via combinatorics on words
收藏 引用
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE 2012年 第1期14卷 141-146页
作者: Kufleitner, Manfred Lauser, Alexander Univ Stuttgart D-7000 Stuttgart Germany
The join of two varieties is the smallest variety containing both. In finite semigroup theory, the varieties of R-trivial and L-trivial monoids are two of the most prominent classes of finite monoids. Their join is kn... 详细信息
来源: 评论
AUTOMATIC THEOREM-PROVING IN combinatorics on words
收藏 引用
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 2013年 第6期24卷 781-798页
作者: Goc, Daniel Henshall, Dane Shallit, Jeffrey Univ Waterloo Sch Comp Sci Waterloo ON N2L 3G1 Canada
We describe a technique for mechanically proving certain kinds of theorems in combinatorics on words, using finite automata and a software package for manipulating them. We illustrate our technique by applying it to (... 详细信息
来源: 评论
Formalizing a Fragment of combinatorics on words  13th
Formalizing a Fragment of Combinatorics on Words
收藏 引用
13th Conference on Computability in Europe (CiE) - Unveiling Dynamics and Complexity
作者: Holub, Stepan Veroff, Robert Charles Univ Prague Dept Algebra Prague Czech Republic Univ New Mexico Dept Comp Sci Albuquerque NM 87131 USA
We describe an attempt to formalize some tasks in combinatorics on words using the assistance of Prover9, an automated theorem prover for first-order and equational logic.
来源: 评论
Abelian combinatorics on words: A survey
收藏 引用
COMPUTER SCIENCE REVIEW 2023年 47卷
作者: Fici, Gabriele Puzynina, Svetlana Univ Palermo Dipartimento Matemat & Informat Via Archirafi 34 I-90123 Palermo Italy St Petersburg State Univ Fac Math & Comp Sci 14th Line Vasilievski Isl 29 St Petersburg 199178 Russia Sobolev Inst Math 4 Acad Koptyug Ave Novosibirsk 630090 Russia
We survey known results and open problems in abelian combinatorics on words. Abelian combinatorics on words is the extension to the commutative setting of the classical theory of combinatorics on words. The extension ... 详细信息
来源: 评论
combinatorics of words and morphisms in some pieces of Tom Johnson
收藏 引用
JOURNAL OF MATHEMATICS AND MUSIC 2018年 第3期12卷 248-257页
作者: Allouche, Jean-Paul Johnson, Tom Sorbonne Univ IMJ PRG CNRS Paris France Edit 75 Paris France
We survey several occurrences of combinatorics of words and morphisms in the pieces of Tom Johnson, showing in particular that some of the sequences of notes that he used intuitively can be interpreted or constructed ... 详细信息
来源: 评论
On the number of equal-letter runs of the bijective Burrows-Wheeler transform
收藏 引用
THEORETICAL COMPUTER SCIENCE 2025年 1027卷
作者: Biagi, Elena Cenzato, Davide Liptak, Zsuzsanna Romana, Giuseppe Univ Helsinki Dept Comp Sci Helsinki Finland CaFoscari Univ Venice Dept Environm Sci Informat & Stat Venice Italy Univ Verona Dept Comp Sci Verona Italy Univ Palermo Dept Math & Informat Palermo Italy
The Bijective Burrows-Wheeler Transform (BBWT) is a variant of the famous BWT [Burrows and Wheeler, 1994]. The BBWT was introduced by Gil and Scott in 2012, and is based on the extended BWT of Mantaci et al. [TCS 2007... 详细信息
来源: 评论
Derived sequences of the (n, j)-bonacci sequences
收藏 引用
NONLINEARITY 2025年 第3期38卷 035006-035006页
作者: Huang, Yuke Wen, Zhiying Beijing Univ Posts & Telecommun Sch Sci Beijing 100876 Peoples R China Beijing Univ Posts & Telecommun Key Lab Math & Informat Network Minist Educ Beijing 100876 Peoples R China Tsinghua Univ Dept Math Sci Beijing 100084 Peoples R China
Derived sequence is an important theme in combinatorics on words. Let Sn,j be the infinite one-sided sequence over the alphabet {ad, 1 = 2 and j >= 1.
来源: 评论