Tome 49 (2015) no. 2

Sommaire

Computing the 2-blocks of directed graphs
p. 93-119
An upper bound on the complexity of recognizable tree languages
p. 121-137
Towards using the history in online computation with advice
p. 139-152
Linear grammars with one-sided contexts and their automaton representation
p. 153-178