Show Bookstore Categories

Algorithms and Lower Bounds in Finite Automata Size Complexity

Algorithms and Lower Bounds in Finite Automata Size Complexity

ByChristos Kapoutsis

Usually printed in 3 - 5 business days
This is the PhD thesis submitted by the author to the Department of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology in June 2006.

Details

Publication Date
Aug 4, 2006
Language
English
Category
Education & Language
Copyright
All Rights Reserved - Standard Copyright License
Contributors
By (author): Christos Kapoutsis

Specifications

Pages
121
Binding
Linen Wrap
Interior Color
Black & White
Dimensions
US Trade (6 x 9 in / 152 x 229 mm)

Ratings & Reviews