设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
CNKI学位论文(3)
知网期刊论文(1)
在“
Elsevier电子期刊
”中,
命中:
12
条,耗时:0.0319853 秒
在所有数据库中总计命中:
4
条
1.
Markov
word
patterns and a relation on -
word
s
作者:
Wai-Fong Chuan
a
;
waifong@cycu.edu.tw" class="auth_mail" title="E-mail the corresponding author
;
Fang-Yi Liao
a
;
fyliao920@gmail.com" class="auth_mail" title="E-mail the corresponding author
;
Fei Yu
b
;
aypyufei@mail.ypu.edu.tw" class="auth_mail" title="E-mail the corresponding author
关键词:
Irrational characteristic
word
;
Adjacent αα-
word
;
Markov
word
pattern
;
Seed
word
;
Simple
Sturmian
word
刊名:Discrete Applied Mathematics
出版年:2016
2.
Closed factorization
作者:
Golnaz Badkobeh
a
;
g.badkobeh@sheffield.ac.uk" class="auth_mail" title="E-mail the corresponding author
;
Hideo Bannai
b
;
bannai@inf.kyushu-u.ac.jp" class="auth_mail" title="E-mail the corresponding author
;
Keisuke Goto
b
;
keisuke.gotou@inf.kyushu-u.ac.jp" class="auth_mail" title="E-mail the corresponding author
;
Tomohiro I
c
;
tomohiro.i@cs.tu-dortmund.de" class="auth_mail" title="E-mail the corresponding author
;
Costas S. Iliopoulos
d
;
c.iliopoulos@kcl.ac.uk" class="auth_mail" title="E-mail the corresponding author
;
Shunsuke Inenaga
b
;
inenaga@inf.kyushu-u.ac.jp" class="auth_mail" title="E-mail the corresponding author
;
Simon J. Puglisi
e
;
puglisi@cs.helsinki.fi" class="auth_mail" title="E-mail the corresponding author
;
Shiho Sugimoto
b
;
shiho.sugimoto@inf.kyushu-u.ac.jp" class="auth_mail" title="E-mail the corresponding author
关键词:
Closed strings
;
Borders
;
Suffix trees
;
Range successor queries
;
Manhattan skyline problem
刊名:Discrete Applied Mathematics
出版年:2016
3.
A study of Jacobi-Perron boundary
word
s for the generation of discrete planes
作者:
Val¨¦rie Berth¨¦
;
Annie Lacasse
;
Genevi¨¨ve Paquin
;
Xavier Proven?al
关键词:
Discrete plane
;
Discrete geometry
;
Multidimensional continued fractions
;
Substitutions
刊名:Theoretical Computer Science
出版年:2013
4.
Maximal pattern complexity of higher dimensional
word
s
作者:
Yan-hui Qu
;
Hui Rao
;
Zhi-ying Wen
;
Yu-mei Xue
关键词:
n
-dimensional
word
;
Maximal pattern complexity
;
Toeplitz
word
刊名:Journal of Combinatorial Theory, Series A
出版年:2010
5.
Compressed string-matching in standard
Sturmian
word
s
作者:
Paweł
;
Baturo
;
Wojciech Rytter
关键词:
Sturmian
word
s
;
String-matching
;
Linear time
;
Lexicographic numeration property
刊名:Theoretical Computer Science
出版年:2009
6.
Burrows–Wheeler transform and palindromic richness
作者:
Antonio Restivo
;
Giovanna Rosone
关键词:
Combinatorics on
word
s
;
Burrows–
;
Wheeler transform
;
Palindromes
;
Rich
word
s
刊名:Theoretical Computer Science
出版年:2009
7.
Periodicity, repetitions, and orbits of an automatic sequence
作者:
Jean-Paul Allouche
;
Narad Rampersad
;
Jeffrey Shallit
关键词:
Automatic sequence
;
Squarefree
;
Overlap-free
;
Thue–
;
Morse sequence
;
Rudin–
;
Shapiro sequence
;
Decidability
;
Periodicity
;
Orbit
;
Orbit closure
;
Continued fraction
刊名:Theoretical Computer Science
出版年:2009
8.
m-Balanced
word
s: A generalization of balanced
word
s
作者:
Sano
;
Shinya
;
Miyoshi
;
Naoto
;
Kataoka
;
Ryohei
关键词:
Balanced
word
s
;
Sturmian
conditions
;
Billiard
word
s
;
Network scheduling problems
刊名:Theoretical Computer Science
出版年:2004
9.
Plane digitization and related combinatorial problems
作者:
Brimkov
;
Valentin E.
;
Barneva
;
Reneta P.
关键词:
Plane discretization
;
Plane digitization
;
Array periodicity
;
Sturmian
word
s
刊名:Discrete Applied Mathematics
出版年:2005
10.
Sturmian
word
s: structure, combinatorics, and their arithmetics
作者:
de Luca
;
Aldo
关键词:
Sturmian
word
s
;
Palindromes
;
Standard
word
s
刊名:Theoretical Computer Science
出版年:1997
1
2
按检索点细分(12)
关键词(1)
文摘(10)
按出版年细分(12)
2016年(2)
2013年(1)
2010年(1)
2009年(3)
2005年(1)
2004年(1)
2001年(1)
2000年(1)
2000年及以前(1)
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via
email
.