中国机械工程学会生产工程分会知识服务平台
主页
文献资源
外文期刊
外文会议
中文期刊
专业机构
生产工程
智能制造
高级检索
关于我们
版权声明
使用帮助
期刊
ISSN
0304-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 transducers
Cyril Allauzen; Mehryar Mohri
2004
2004, vol.328, no.1-2
Conversation protocols: a formalism for specification and verification of reactive electronic services
Xiang Fu; Tevfik Bultan; Jianwen Su
2004
2004, vol.328, no.1-2
Acyclic networks maximizing the printing complexity
Franck Guingne; Florent Nicart; Andre Kempe
2004
2004, vol.328, no.1-2
Branching automata with costs - a way of reflecting parallelism in costs
Dietrich Kuske; Ingmar Meinecke
2004
2004, vol.328, no.1-2
Introducing VAUCANSON
Sylvain Lombardy; Yann Regis-Gianas; Jacques Sakarovitch
2004
2004, vol.328, no.1-2
Ternary directed acyclic word graphs
Satoru Miyamoto; Shunsuke Inenaga; Masayuki Takeda; Ayumi Shinohara
2004
2004, vol.328, no.1-2
Weak minimization of DFA - an algorithm and applications
B. Ravikumar; G. Eisman
2004
2004, vol.328, no.1-2
Bideterministic automata and minimal representations of regular languages
Hellis Tamm; Esko Ukkonen
2004
2004, vol.328, no.1-2
Reducing the time complexity of testing for local threshold testability
A. N. Trahtman
2004
2004, vol.328, no.1-2
On binary {direct +}-NFAs and succinct descriptions of regular languages
Lynette van Zijl
2004
2004, vol.328, no.1-2
1
2
国家科技图书文献中心
全球文献资源网
京ICP备05055788号-26
京公网安备11010202008970号 机械工业信息研究院 2018-2024