RAIRO. Informatique théorique

Free Access

Un langage algébrique particulier p. 203

L. Boasson

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1979130302031

• PDF (1.08 MB)
• References

Free Access

Complexity arguments in algebraic language theory p. 217

Helmut Alt and Kurt Mehlhorn

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1979130302171

• PDF (736 KB)
• References

Free Access

Towards a general principle of evaluation for approximate algorithms p. 227

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

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1979130302271

• PDF (1.18 MB)
• References

Free Access

On simple representations of language families p. 241

K. Culik II and H. A. Maurer

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1979130302411

• PDF (1.12 MB)
• References

Free Access

Énumération des permutations par nombre de marches p. 251

F. Poussin

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1979130302511

• PDF (419 KB)
• References

Free Access

Complexity of $\lambda $-term reductions p. 257

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

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1979130302571

• PDF (2.82 MB)
• References

Free Access

Some further remarks on the family of finite index matrix languages p. 289

Gheorghe PĂun

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1979130302891

• PDF (842 KB)
• References

Free Access

Bibliographie p. 299

RAIRO-ITA

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1979130302991

• PDF (163 KB)