An in-between "implicit" and "explicit" complexity: Automata
Logic in Computer Science
2015-02-05 v2 Computational Complexity
Logic
Abstract
Implicit Computational Complexity makes two aspects implicit, by manipulating programming languages rather than models of com-putation, and by internalizing the bounds rather than using external measure. We survey how automata theory contributed to complexity with a machine-dependant with implicit bounds model.
Cite
@article{arxiv.1502.00145,
title = {An in-between "implicit" and "explicit" complexity: Automata},
author = {Clément Aubert},
journal= {arXiv preprint arXiv:1502.00145},
year = {2015}
}