设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
CNKI学位论文(504)
CNKI期刊论文0611(1)
知网期刊论文(122)
在“
Elsevier电子期刊
”中,
命中:
58
条,耗时:小于0.01 秒
在所有数据库中总计命中:
627
条
1.
Cyclic complexity of
word
s
作者:
Julien Cassaigne
a
;
julien.cassaigne@math.cnrs.fr" class="auth_mail" title="E-mail the corresponding author
;
Gabriele Fici
b
;
gabriele.fici@unipa.it" class="auth_mail" title="E-mail the corresponding author
;
Marinella Sciortino
b
;
marinella.sciortino@unipa.it" class="auth_mail" title="E-mail the corresponding author
;
Luca Q. Zamboni
c
;
zamboni@math.univ-lyon1.fr" class="auth_mail" title="E-mail the corresponding author
关键词:
Cyclic complexity
;
Factor complexity
;
Sturmian
word
s
刊名:Journal of Combinatorial Theory, Series A
出版年:2017
2.
On periodic properties of circular
word
s
作者:
Lá
;
szló
;
Hegedü
;
s
a
;
hegedus.laszlo@inf.unideb.hu" class="auth_mail" title="E-mail the corresponding author
;
Benedek Nagy
a
;
b
;
nbenedek.inf@gmail.com" class="auth_mail" title="E-mail the corresponding author
关键词:
Circular
word
s
;
Weak period
;
Combinatorics on
word
s
刊名:Discrete Mathematics
出版年:2016
3.
A chemical address for the
Morse
Code
作者:
Domenico A. Cristaldi
;
Salvatrice Millesi
;
Placido Mineo
;
Antonino Gulino
;
agulino@unict.it" class="auth_mail" title="E-mail the corresponding author
关键词:
Morse
Code
;
Yttrium
;
Luminescence
;
Diketonate
刊名:Journal of Luminescence
出版年:2016
4.
Another generalization of abelian equivalence: Binomial complexity of infinite
word
s
作者:
M. Rigo
a
;
M.Rigo@ulg.ac.be" class="auth_mail" title="E-mail the corresponding author
;
P. Salimov
a
;
b
;
1
关键词:
Combinatorics on
word
s
;
Abelian equivalence
;
Binomial coefficient
;
Factor complexity
;
Sturmian
word
s
;
Thue&ndash
;
Morse
word
刊名:Theoretical Computer Science
出版年:2015
5.
On additive properties of sets defined by the Thue-
Morse
word
作者:
Michelangelo Bucci
a
;
michelangelo.bucci@utu.fi
;
Neil Hindman
b
;
1
;
nhindman@aol.com
;
Svetlana Puzynina
a
;
c
;
2
;
svepuz@utu.fi
;
Luca Q. Zamboni
a
;
d
;
3
;
lupastis@gmail.com
关键词:
Partition regularity
;
Additive combinatorics
;
IP-sets
;
Thue&ndash
;
Morse
infinite
word
刊名:Journal of Combinatorial Theory, Series A
出版年:2013
6.
Recurrence in infinite partial
word
s
作者:
F. Blanchet-Sadri
;
Bob Chen
;
Sinziana Munteanu
关键词:
Automata and formal languages
;
Combinatorics on
word
s
;
Partial
word
s
;
Recurrent
word
s
;
Recurrence quotient
;
Recurrence function
刊名:Theoretical Computer Science
出版年:6 March, 2014
7.
On the structure of compacted sub
word
graphs of Thue-
Morse
word
s and their applications
作者:
Jakub Radoszewski
;
jrad@mimuw.edu.pl
;
Wojciech Rytter
rytter@mimuw.edu.pl
关键词:
Thue&ndash
;
Morse
word
;
Compacted sub
word
graph
;
Graph counting property
刊名:Journal of Discrete Algorithms
出版年:2012
8.
Palindromic closures using multiple antimorphisms
作者:
Tatiana Jajcayová
;
a
;
Edita Pelantová
;
b
;
&Scaron
;
t臎pá
;
n Starosta
c
;
关键词:
Palindromic closure
;
Generalized Thue&ndash
;
Morse
word
;
Involutory antimorphism
刊名:Theoretical Computer Science
出版年:8 May, 2014
9.
Introducing privileged
word
s: Privileged complexity of Sturmian
word
s
作者:
Jarkko Peltom?ki
关键词:
Combinatorics on
word
s
;
Sturmian
word
s
;
Palindromes
;
Privileged
word
s
;
Return
word
s
;
Rich
word
s
刊名:Theoretical Computer Science
出版年:2013
10.
Languages invariant under more symmetries: Overlapping factors versus palindromic richness
作者:
Edita Pelantov¨¢
;
?t¨§p¨¢n Starosta
关键词:
Palindromic richness
;
Overlaps
;
Symmetries
;
Thue&ndash
;
Morse
word
;
Group palindromic richness
刊名:Discrete Mathematics
出版年:2013
1
2
3
4
5
6
按检索点细分(58)
题名(6)
关键词(25)
文摘(38)
按出版年细分(58)
2027年及以后(3)
2017年(1)
2016年(2)
2015年(1)
2013年(6)
2012年(3)
2011年(8)
2010年(1)
2009年(6)
2008年(1)
2007年(4)
2006年(2)
2005年(4)
2004年(4)
2003年(3)
2002年(2)
2001年(2)
2000年(1)
2000年及以前(4)
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
.