Jeffrey Shallit and Ming-Wei Wang. Automatic complexity of strings. Journal of Automata, Languages and Combinatorics, vol. 6 , pp. 537–554. - Cristian S. Calude, Kai Salomaa and Tania K. Roblot. Finite-state complexity and randomness. Theoretical Computer Science, vol. 412 , no. 41, pp. 5668–5677. - Cristian S. Calude, Kai Salomaa and Tania K. Roblot. State-size hierarchy for finite-state complexity. International Journal of Foundations of Computer Science, vol. 23 , no. 1, pp. 37–50 [Book Review]

Bulletin of Symbolic Logic 18 (4):579-580 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1017/s1079898600008982

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,758

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Deterministic automata simulation, universality and minimality.Cristian Calude, Elena Calude & Bakhadyr Khoussainov - 1997 - Annals of Pure and Applied Logic 90 (1-3):263-276.
Computation and automata.Arto Salomaa - 1985 - New York: Cambridge University Press.
Discrete Mathematics and Theoretical Computer Science 4th International Conference, Dmtcs 2003, Dijon, France, July 2003, Proceedings.Cristian Calude, M. J. Dinneen & Vincent Vajnovszki - 2003 - Springer Verlag.
Are binary codings universal?Cristian Calude & Cezar Câmpeanu - 1996 - Complexity 1 (5):47-50.
Topological complexity of locally finite ω-languages.Olivier Finkel - 2008 - Archive for Mathematical Logic 47 (6):625-651.
Elements of Finite Model Theory.Leonid Libkin - 2004 - Springer.
Combinatorics, Computability and Logic: Proceedings of the Third International Conference on Combinatorics, Computability and Logic, (DMTCS’01).C. S. Calude - 2001 - Springer.
Incompleteness, complexity, randomness and beyond.Cristian S. Calude - 2002 - Minds and Machines 12 (4):503-517.
A genius's story: Two books on Gödel.Cristian S. Calude - 1997 - Complexity 3 (2):11-15.
Computing with cells and atoms in a nutshell.Cristian S. Calude & Gheorghe P.?un - 2000 - Complexity 6 (1):38-48.
Finite Automata, Formal Logic, and Circuit Complexity.Howard Straubing - 1994 - Birkhäuser.
Computing with cells and atoms in a nutshell.Cristian S. Calude & Gheorghe Păun - 2000 - Complexity 6 (1):38-48.
Automata presenting structures: A survey of the finite string case.Sasha Rubin - 2008 - Bulletin of Symbolic Logic 14 (2):169-209.
On partial randomness.Cristian S. Calude, Ludwig Staiger & Sebastiaan A. Terwijn - 2006 - Annals of Pure and Applied Logic 138 (1):20-30.
Finite Model Theory and its Applications.Erich Grädel, Phokion Kolaitis, Libkin G., Marx Leonid, Spencer Maarten, Vardi Joel, Y. Moshe, Yde Venema & Scott Weinstein - 2007 - Springer.

Analytics

Added to PP
2019-04-25

Downloads
15 (#969,592)

6 months
3 (#1,034,177)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references