An in-between "implicit" and "explicit" complexity: Automata
Résumé
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.
Origine | Fichiers produits par l'(les) auteur(s) |
---|