An in-between "implicit" and "explicit" complexity: Automata

Abstract : Implicit Computational Complexity makes two aspects implicit, by manipulating programming languages rather than models of computation, 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.
Type de document :
Communication dans un congrès
DICE 2015 - Developments in Implicit Computational Complexity, Apr 2015, Londres, United Kingdom. 〈http://dice15.computing.dundee.ac.uk/〉
Liste complète des métadonnées

Littérature citée [19 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01111737
Contributeur : Clément Aubert <>
Soumis le : vendredi 29 mai 2015 - 11:18:30
Dernière modification le : mardi 13 décembre 2016 - 15:43:08
Document(s) archivé(s) le : lundi 24 avril 2017 - 17:44:57

Identifiants

  • HAL Id : hal-01111737, version 2
  • ARXIV : 1502.00145

Collections

Citation

Clément Aubert. An in-between "implicit" and "explicit" complexity: Automata. DICE 2015 - Developments in Implicit Computational Complexity, Apr 2015, Londres, United Kingdom. 〈http://dice15.computing.dundee.ac.uk/〉. 〈hal-01111737v2〉

Partager

Métriques

Consultations de
la notice

432

Téléchargements du document

165