Tome 27 (1993) no. 1

Sommaire

Prescribed ultrametrics
p. 1-5
On the structure of recognizable languages of dependence graphs
p. 7-22
A fast algorithm to decide on the equivalence of stateless DPDA
p. 23-48
Efficient reductions of picture words
p. 49-56
PCP-prime words and primality types
p. 57-70
On languages satisfying “interchange lemma”
p. 71-79