Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01111737
Contributor : Clément Aubert <>
Submitted on : Friday, May 29, 2015 - 11:18:30 AM
Last modification on : Friday, November 8, 2019 - 11:26:12 AM
Document(s) archivé(s) le : Monday, April 24, 2017 - 5:44:57 PM

Identifiers

  • 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. ⟨hal-01111737v2⟩

Share

Metrics

Record views

637

Files downloads

377