Skip to Main content Skip to Navigation
Conference papers

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

Clément Aubert 1, 2
1 SPADES - Sound Programming of Adaptive Dependable Embedded Systems
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
2 LACL - Laboratoire d'Algorithmique Complexité et Logique
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.
Keywords : Pointer Machine Survey Implicit Computational Complexity Automata Logspace Polynomial Time
Document type :
Conference papers
Complete list of metadata

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 : Monday, February 15, 2021 - 3:52:02 PM
Long-term archiving on: : Monday, April 24, 2017 - 5:44:57 PM

Files

Vignette du document
standalone.pdf
Files produced by the author(s)

Licence

Open licence - etalab

Identifiers

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

Collections

CNRS | LACL | INSMI | INRIA | UPEC-UPEM | LIG-MFML-SPADES | LIG | UPEC | UGA

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⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

661

Files downloads

458