Algorithms and Lower Bounds in Finite Automata Size Complexity

Algorithms and Lower Bounds in Finite Automata Size Complexity

ByChristos Kapoutsis

This ebook may not meet accessibility standards and may not be fully compatible with assistive technologies.
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
Oct 1, 2011
Language
English
Category
Education & Language
Copyright
All Rights Reserved - Standard Copyright License
Contributors
By (author): Christos Kapoutsis

Specifications

Format
PDF

Ratings & Reviews