期刊


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

题名作者出版年年卷期
Developments from enquiries into the learnability of the pattern languages from positive dataYen Kaow Ng; Takeshi Shinohara20082008, vol.397, no.1-3
Learning indexed families of recursive languages from positive data: A surveySteffen Lange; Thomas Zeugmann; Sandra Zilles20082008, vol.397, no.1-3
Discontinuities in pattern inferenceDaniel Reidenbach20082008, vol.397, no.1-3
Some classes of term rewriting systems inferable from positive dataM. R. K. Krishna Rao20082008, vol.397, no.1-3
Learning and extending sublanguagesSanjay Jain; Efim Kinber20082008, vol.397, no.1-3
Learning recursive functions: A surveyThomas Zeugmann; Sandra Zilles20082008, vol.397, no.1-3
Absolute versus probabilistic classification in a logical settingSanjay Jain; Eric Martin; Frank Stephan20082008, vol.397, no.1-3
Reflective inductive inference of recursive functionsGunter Grieser20082008, vol.397, no.1-3
Quantum inductive inference by finite automataR. Freivalds; R. F. Bonner20082008, vol.397, no.1-3
Measuring teachability using variants of the teaching dimensionFrank J. Balbach20082008, vol.397, no.1-3
12