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

Clément Aubert (1, 2)

1 SPADES - Sound Programming of Adaptive Dependable Embedded Systems
2 LACL - Laboratoire d'Algorithmique Complexité et Logique

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.

Mots clés: Polynomial Time; Pointer Machine; Survey; Implicit Computational Complexity; Automata; Logspace

Domaines: Logique en informatique [cs.LO]; Logique [math.LO]; Complexité [cs.CC]

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⟩