设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
Springer电子图书(2)
SpringerLink电子期刊(17)
Elsevier电子期刊(17)
在“
Elsevier电子期刊
”中,
命中:
17
条,耗时:小于0.01 秒
在所有数据库中总计命中:
36
条
1.
A Garden of Eden theorem for Anosov diffeomorphisms on tori
作者:
Tullio
Ceccherini
-
Silberstein
a
;
tceccher@mat.uniroma3.it" class="auth_mail" title="E-mail the corresponding author
;
Michel Coornaert
b
;
coornaert@math.unistra.fr" class="auth_mail" title="E-mail the corresponding author
关键词:
37D20
;
37C29
;
37B40
;
37B10
;
37B15
刊名:Topology and its Applications
出版年:2016
2.
Multipass automata and group word problems
作者:
Tullio
Ceccherini
-
Silberstein
a
;
tceccher@mat.uniroma3.it" class="auth_mail" title="E-mail the corresponding author
;
Michel Coornaert
b
;
coornaert@math.unistra.fr" class="auth_mail" title="E-mail the corresponding author
;
Francesca Fiorenzi
c
;
fiorenzi@lri.fr" class="auth_mail" title="E-mail the corresponding author
;
Paul E. Schupp
d
;
schupp@math.uiuc.edu" class="auth_mail" title="E-mail the corresponding author
;
Nicholas W.M. Touikan
e
;
nicholas.touikan@gmail.com" class="auth_mail" title="E-mail the corresponding author
关键词:
Pushdown automaton
;
Multipass automaton
;
Context-free language
;
Finitely generated group
;
The word problem
刊名:Theoretical Computer Science
出版年:2015
3.
Cellular automata between sofic tree shifts
作者:
Tullio
Ceccherini
-
Silberstein
;
Michel Coornaert
;
Francesca Fiorenzi
;
Zoran ?uni?
关键词:
Free monoid
;
Regular rooted tree
;
Tree shift
;
Subshift
;
Shift of finite type
;
Sofic shift
;
Unrestricted Rabin automaton
;
Cellular automaton
;
Surjectivity problem
;
Injectivity problem
刊名:Theoretical Computer Science
出版年:2013
4.
Groups, graphs, languages, automata, games and second-order monadic logic
作者:
Tullio
Ceccherini
-
Silberstein
a
;
tceccher@mat.uniroma3.it
;
Michel Coornaert
b
;
coornaert@math.unistra.fr
;
Francesca Fiorenzi
c
;
fiorenzi@lri.fr
;
Paul E. Schupp
d
;
schupp@math.uiuc.edu
刊名:European Journal of Combinatorics
出版年:2012
5.
Context-free pairs of groups I: Context-free pairs and graphs
作者:
Tullio
Ceccherini
-
Silberstein
a
;
tceccher@mat.uniroma3.it
;
Wolfgang Woess
b
;
woess@TUGraz.at
刊名:European Journal of Combinatorics
出版年:2012
6.
On a family of Schreier graphs of intermediate growth associated with a self-similar group
作者:
Ievgen Bondarenko
a
;
ibond.univ@gmail.com
;
Tullio
Ceccherini
-
Silberstein
b
;
1
;
tceccher@mat.uniroma3.it
;
Alfredo Donno
c
;
alfredo.donno@sbai.uniroma1.it
;
Volodymyr Nekrashevych
d
;
nekrash@math.tamu.edu
刊名:European Journal of Combinatorics
出版年:2012
7.
Preface
作者:
Tullio
Ceccherini
-
Silberstein
tceccher@mat.uniroma3.it
刊名:European Journal of Combinatorics
出版年:2012
8.
On the reversibility and the closed image property of linear cellular automata
作者:
Tullio
Ceccherini
-
Silberstein
a
;
tceccher@mat.uniroma1.it
;
Michel Coornaert
b
;
coornaert@math.unistra.fr
关键词:
Cellular automaton
;
Linear cellular automaton
;
Reversible cellular automaton
;
Closed image property
;
Mittag-Leffler lemma
刊名:Theoretical Computer Science
出版年:2011
9.
A generalization of the Curtis–Hedlund theorem
作者:
Tullio
Ceccherini
-
Silberstein
;
Michel Coornaert
关键词:
Cellular automaton
;
Uniform space
;
Curtis–
;
Hedlund theorem
刊名:Theoretical Computer Science
出版年:2008
10.
Linear cellular automata over modules of finite length and stable finiteness of group rings
作者:
Tullio
Ceccherini
-
Silberstein
;
Michel Coornaert
关键词:
Linear cellular automaton
;
Sofic group
;
Artinian module
;
Noetherian module
;
Module of finite length
;
Group ring
;
Direct finiteness
;
Stable finiteness
刊名:Journal of Algebra
出版年:2007
1
2
按检索点细分(17)
作者(17)
按出版年细分(17)
2016年(1)
2015年(1)
2013年(1)
2012年(4)
2011年(1)
2008年(1)
2007年(1)
2006年(1)
2005年(1)
2004年(1)
2003年(2)
2001年(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
.