Toward an Algebraic proof of Toda's theorem
This thesis is devoted to an approach of computational complexity based on computations within finite semigroups. === The theory of finite semigroups and its algebraic aspects are deeply connected with the theory of automata and regular languages [Eil76a] [Pin86]. The link between finite monoids and...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en |
| Published: |
McGill University
2000
|
| Subjects: | |
| Online Access: | http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=30695 |