期刊


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

2008, vol.390, no.1 2008, vol.390, no.2-3 2008, vol.391, no.1-2 2008, vol.391, no.3 2008, vol.392, no.1-3 2008, vol.393, no.1-3
2008, vol.394, no.1-2 2008, vol.394, no.3 2008, vol.395, no.1 2008, vol.395, no.2-3 2008, vol.396, no.1-3 2008, vol.397, no.1-3
2008, vol.398, no.1-3 2008, vol.399, no.1-2 2008, vol.399, no.3 2008, vol.400, no.1-3 2008, vol.401, no.1-3 2008, vol.402, no.1
2008, vol.402, no.2-3 2008, vol.403, no.1 2008, vol.403, no.2-3 2008, vol.404, no.1-2 2008, vol.404, no.3 2008, vol.405, no.1-2
2008, vol.405, no.3 2008, vol.406, no.1-2 2008, vol.406, no.3 2008, vol.407, no.1-3 2008, vol.408, no.1 2008, vol.408, no.2-3
2008, vol.409, no.1 2008, vol.409, no.2 2008, vol.409, no.3

题名作者出版年年卷期
Shuffle operations on discrete pathsS. Brlek; G. Labelle; A. Lacasse20082008, vol.391, no.1-2
Completing circular codes in regular submonoidsJean Neraud20082008, vol.391, no.1-2
Regular languages and their generating functions: The inverse problemChristoph Koutschan20082008, vol.391, no.1-2
An algorithm for recognition of n-collapsing wordsI. V. Petrov20082008, vol.391, no.1-2
Cancellation and periodicity properties of iterated morphismsJuha Honkala20082008, vol.391, no.1-2
Generalized approximate counting revisitedGuy Louchard; Helmut Prodinger20082008, vol.391, no.1-2
Simple permutations: Decidability and unavoidable substructuresRobert Brignall; Nik Ruskuc; Vincent Vatter20082008, vol.391, no.1-2
Symmetrized β-integersJulien Bernat20082008, vol.391, no.1-2
A conversion algorithm based on the technique of singularizationB. Schratzberger20082008, vol.391, no.1-2
A characterization of fine words over a finite alphabetAmy Glen20082008, vol.391, no.1-2
12