RAIRO. Informatique théorique, Volume 13 (1979) no. 3

Table of contents

Un langage algébrique particulier

Boasson, L.

p. 203-215

Complexity arguments in algebraic language theory

Alt, Helmut; Mehlhorn, Kurt

p. 217-225

Towards a general principle of evaluation for approximate algorithms

Aiello, A.; Burattini, E.; Massarotti, A.; Ventriglia, F.

p. 227-239

On simple representations of language families

Culik II, K.; Maurer, H. A.

p. 241-250

Énumération des permutations par nombre de marches

Poussin, F.

p. 251-255

Complexity of

λ

-term reductions

Dezani-Ciancaglini, M.; Ronchi Della Rocca, S.; Saitta, L.

p. 257-287

Some further remarks on the family of finite index matrix languages

PĂun, Gheorghe

p. 289-297

Bibliographie

RAIRO-ITA

p. 299