期刊


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

2004, vol.310, no.1-3 2004, vol.311, no.1-3 2004, vol.312, no.1 2004, vol.312, no.2-3 2004, vol.313, no.1 2004, vol.313, no.2
2004, vol.313, no.3 2004, vol.314, no.1-2 2004, vol.314, no.3 2004, vol.315, no.1 2004, vol.315, no.2-3 2004, vol.316, no.1-3
2004, vol.317, no.1-3 2004, vol.318, no.1-2 2004, vol.318, no.3 2004, vol.319, no.1-3 2004, vol.320, no.1 2004, vol.320, no.2-3
2004, vol.321, no.1 2004, vol.321, no.2-3 2004, vol.322, no.1 2004, vol.322, no.2 2004, vol.322, no.3 2004, vol.323, no.1-3
2004, vol.324, no.1 2004, vol.324, no.2-3 2004, vol.325, no.1 2004, vol.325, no.2 2004, vol.325, no.3 2004, vol.326, no.1-3
2004, vol.327, no.1-2 2004, vol.327, no.3 2004, vol.328, no.1-2 2004, vol.328, no.3 2004, vol.329, no.1-3

题名作者出版年年卷期
An optimal pre-determinization algorithm for weighted transducersCyril Allauzen; Mehryar Mohri20042004, vol.328, no.1-2
Conversation protocols: a formalism for specification and verification of reactive electronic servicesXiang Fu; Tevfik Bultan; Jianwen Su20042004, vol.328, no.1-2
Acyclic networks maximizing the printing complexityFranck Guingne; Florent Nicart; Andre Kempe20042004, vol.328, no.1-2
Branching automata with costs - a way of reflecting parallelism in costsDietrich Kuske; Ingmar Meinecke20042004, vol.328, no.1-2
Introducing VAUCANSONSylvain Lombardy; Yann Regis-Gianas; Jacques Sakarovitch20042004, vol.328, no.1-2
Ternary directed acyclic word graphsSatoru Miyamoto; Shunsuke Inenaga; Masayuki Takeda; Ayumi Shinohara20042004, vol.328, no.1-2
Weak minimization of DFA - an algorithm and applicationsB. Ravikumar; G. Eisman20042004, vol.328, no.1-2
Bideterministic automata and minimal representations of regular languagesHellis Tamm; Esko Ukkonen20042004, vol.328, no.1-2
Reducing the time complexity of testing for local threshold testabilityA. N. Trahtman20042004, vol.328, no.1-2
On binary {direct +}-NFAs and succinct descriptions of regular languagesLynette van Zijl20042004, vol.328, no.1-2
12