期刊


ISSN0304-3975
刊名Theoretical Computer Science
参考译名理论计算机科学
收藏年代2002～2024



全部

2002 2003 2004 2005 2006 2007
2008 2009 2010 2011 2012 2013
2014 2015 2016 2017 2018 2019
2020 2021 2022 2023 2024

2009, vol.410, no.1 2009, vol.410, no.11 2009, vol.410, no.12-13 2009, vol.410, no.14 2009, vol.410, no.15 2009, vol.410, no.16
2009, vol.410, no.17 2009, vol.410, no.18 2009, vol.410, no.19 2009, vol.410, no.20 2009, vol.410, no.21/23 2009, vol.410, no.2-3
2009, vol.410, no.24/25 2009, vol.410, no.26 2009, vol.410, no.27/29 2009, vol.410, no.30/32 2009, vol.410, no.33/34 2009, vol.410, no.35
2009, vol.410, no.36 2009, vol.410, no.37 2009, vol.410, no.38/40 2009, vol.410, no.41 2009, vol.410, no.42 2009, vol.410, no.43
2009, vol.410, no.44 2009, vol.410, no.45 2009, vol.410, no.4-5 2009, vol.410, no.46 2009, vol.410, no.47/49 2009, vol.410, no.50
2009, vol.410, no.51 2009, vol.410, no.52 2009, vol.410, no.6-7 2009, vol.410, no.8-10

题名作者出版年年卷期
Periodicity, repetitions, and orbits of an automatic sequenceJean-Paul Allouche; Narad Rampersad; Jeffrey Shallit20092009, vol.410, no.30/32
Compressed string-matching in standard Sturmian wordsPawet Baturo; Wojciech Rytter20092009, vol.410, no.30/32
Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithmJean Berstel; Luc Boasson; Olivier Carton20092009, vol.410, no.30/32
On the number of α-power-free binary words for 2 < α ≤ 7/3Vincent D. Blondel; Julien Cassaigne; Raphael M. Jungers20092009, vol.410, no.30/32
Finding compact structural motifsDongbo Bu; Ming Li; Shuai Cheng Li; Jianbo Qian; Jinbo Xu20092009, vol.410, no.30/32
Characteristic morphisms of generalized episturmian wordsMichelangelo Bucci; Aldo de Luca; Alessandro De Luca20092009, vol.410, no.30/32
A new characteristic property of rich wordsMichelangelo Bucci; Alessandro De Luca; Amy Glen; Luca Q. Zamboni20092009, vol.410, no.30/32
A Sturmian sequence related to the uniqueness conjecture for Markoff numbersYann Bugeaud; Christophe Reutenauer; Samir Siksek20092009, vol.410, no.30/32
The "equal last letter" predicate for words on infinite alphabets and classes of multitape automataChristian Choffrut; Serge Grigorieff20092009, vol.410, no.30/32
Dejean's conjecture holds for n ≥ 30James Currie; Narad Rampersad20092009, vol.410, no.30/32
123



国家科技图书文献中心  全球文献资源网  京ICP备05055788号-26  机械工业信息研究院 2018-2024