Volume 13 (1979) no. 3

Table of contents

Un langage algébrique particulier
p. 203-215
Complexity arguments in algebraic language theory
p. 217-225
Towards a general principle of evaluation for approximate algorithms
p. 227-239
On simple representations of language families
p. 241-250
Énumération des permutations par nombre de marches
p. 251-255
Complexity of λ-term reductions
p. 257-287
Some further remarks on the family of finite index matrix languages
p. 289-297
Bibliographie
p. 299