History

Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 41 61 81 101 | next | last

Result 1 to 20 of 170 total

Asymptotic subword complexity. (English)
Bordihn, Henning (ed.) et al., Languages alive. Essays dedicated to Jürgen Dassow on the occasion of his 65th birthday. Berlin: Springer (ISBN 978-3-642-31643-2/pbk). Lecture Notes in Computer Science 7300, 236-245 (2012).
1
A correspondence principle for exact constructive dimension. (English)
Cooper, S. Barry (ed.) et al., How the world computes. Turing centenary conference and 8th conference on computability in Europe, CiE 2012, Cambridge, UK, June 18‒23, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30869-7/pbk). Lecture Notes in Computer Science 7318, 686-695 (2012).
2
On oscillation-free chaitin $h$-random sequences. (English)
Dinneen, Michael J. (ed.) et al., Computation, physics and beyond. International workshop on theoretical computer science, WTCS 2012, dedicated to Cristian S. Calude on the occasion of his 60th birthday, Auckland, New Zealand, February 21‒24, 2012. Revised selected and invited papers. Berlin: Springer (ISBN 978-3-642-27653-8/pbk). Lecture Notes in Computer Science 7160, 194-202 (2012).
3
From error-correcting codes to algorithmic information theory. (English)
Zenil, Hector (ed.), Randomness through computation. Some answers, more questions. Hackensack, NJ: World Scientific (ISBN 978-981-4327-74-9/hbk; 978-981-4327-75-6/ebook). 293-296 (2011).
4
Constructive dimension and Hausdorff dimension: The case of exact dimension. (English)
Owe, Olaf (ed.) et al., Fundamentals of computation theory. 18th international symposium, FCT 2011, Oslo, Norway, August 22‒25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22952-7/pbk). Lecture Notes in Computer Science 6914, 252-263 (2011).
5
Exact constructive dimension. (English)
Electron. Colloq. Comput. Complex. 18, 74 (2011).
6
Universal recursively enumerable sets of strings. (English)
Theor. Comput. Sci. 412, No. 22, 2253-2261 (2011).
Reviewer: Liang Yu (Nanjing)
7
Constructive dimension and Hausdorff dimension: the case of exact dimension (English)
FCT, 252-263 (2011).
8
A note on accelerated Turing machines. (English)
Math. Struct. Comput. Sci. 20, No. 6, 1011-1017 (2010).
9
Topologies refining the Cantor topology on $X^ω$. (English)
Calude, Christian S. (ed.) et al., Theoretical computer science. 6th IFIP WG 2.2 international conference, TCS 2010, held as a Part of the World Computer Congress (WCC 2010), Brisbane, Australia, September 20‒23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15239-9/hbk; 978-3-642-15240-5/ebook). IFIP Advances in Information and Communication Technology 323, 271-285 (2010).
10
Joint topologies for finite and infinite words. (English)
Gao, Yuan (ed.) et al., Developments in language theory. 14th international conference, DLT 2010, London, ON, Canada, August 17‒20, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14454-7/pbk). Lecture Notes in Computer Science 6224, 442-443 (2010).
11
The maximal subword complexity of quasiperiodic infinite words (English)
DCFS, 169-176 (2010).
12
Joint topologies for finite and infinite words (English)
Developments in Language Theory, 442-443 (2010).
13
Topologies refining the Cantor topology on $X^{{\it omega}}$ (English)
IFIP TCS, 271-285 (2010).
14
On oscillation-free epsilon-random sequences. II. (English)
Bauer, Andrej (ed.) et al., 6th international conference on computability and complexity in analysis (CCA’09). Proceedings of the international conference, August 18‒22, 2009, Ljubljana, Slovenia. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-12-5). OASIcs ‒ OpenAccess Series in Informatics 11, 11 p., electronic only (2009).
15
Topology on words. (English)
Theor. Comput. Sci. 410, No. 24-25, 2323-2335 (2009).
16
On universal computably enumerable prefix codes. (English)
Math. Struct. Comput. Sci. 19, No. 1, 45-57 (2009).
17
On oscillation-free epsilon-random sequences II (English)
CCA (2009).
18
On oscillation-free $ε$-random sequences. (English)
Electron. Notes Theor. Comput. Sci. 221, 287-297 (2008).
19
Universal recursively enumerable sets of strings. (English)
Ito, Masami (ed.) et al., Developments in language theory. 12th international conference, DLT 2008, Kyoto, Japan, September 16‒19, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85779-2/pbk). Lecture Notes in Computer Science 5257, 170-182 (2008).
20
first | previous | 1 21 41 61 81 101 | next | last

Result 1 to 20 of 170 total