期刊


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

题名作者出版年年卷期
Synchronizing monotonic automataD. S. Ananichev; M. V. Volkov20042004, vol.327, no.3
NFA reduction algorithms by means of regular inequalitiesJ.-M. Champarnaud; F. Coulon20042004, vol.327, no.3
Well quasi-orders and context-free grammarsFlavio D'Alessandro; Stefano Varricchio20042004, vol.327, no.3
Frequency of symbol occurrences in bicomponent stochastic modelsDiego de Falco; Massimiliano Goldwurm; Violetta Lonati20042004, vol.327, no.3
Deleting string rewriting systems preserve regularityDieter Hofbauer; Johannes Waldmann20042004, vol.327, no.3
On deterministic finite automata and syntactic monoid sizeMarkus Holzer; Barbara Konig20042004, vol.327, no.3
Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automatonInes Klimann; Sylvain Lombardy; Jean Mairesse; Christophe Prieur20042004, vol.327, no.3
Minimizing finite automata is computationally hardAndreas Malcher20042004, vol.327, no.3



制造业外文文献服务平台