Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

Review

Reviewed Works: Automatic complexity of strings. Journal of Automata, Languages and Combinatorics, vol. 6 by Jeffrey Shallit, Ming-wei Wang; Finite-state complexity and randomness. Theoretical Computer Science, vol. 412, no. 41 by Cristian S. Calude, Kai Salomaa, Tania K. Roblot; State-size hierarchy for finite-state complexity. International Journal of Foundations of Computer Science, vol. 23, no. 1 by Cristian S. Calude, Kai Salomaa, Tania K. Roblot
Review by: Mia Minnes
The Bulletin of Symbolic Logic
Vol. 18, No. 4 (DECEMBER 2012), pp. 579-580
Stable URL: http://www.jstor.org/stable/23316293
Page Count: 2
  • Read Online (Free)
  • Download ($10.00)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
Preview not available
Note: This article is a review of another work, such as a book, film, musical composition, etc. The original work is not included in the purchase of this review.

Page Thumbnails

  • Thumbnail: Page 
579
    579
  • Thumbnail: Page 
580
    580