Free Access to the whole issue

Free Access

Notes on finite asynchronous automata p. 99

Wieslaw Zielonka

Published online: 01 February 2017

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

• Abstract
• PDF (2.18 MB)
• References

Free Access

Sur les centres de DOL-langages p. 137

A. Terlutte

Published online: 01 February 2017

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

• Abstract
• PDF (630 KB)
• References

Free Access

Sequential mappings of $\omega $-languages p. 147

Ludwig Staiger

Published online: 01 February 2017

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

• Abstract
• PDF (1.79 MB)
• References

Free Access

On the complexity of computable real sequences p. 175

Jacobo Torán

Published online: 01 February 2017

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

• Abstract
• PDF (470 KB)
• References

Free Access

Complexité de problèmes liés aux graphes sans circuit p. 181

J. P. Bordat

Published online: 01 February 2017

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

• Abstract
• PDF (1.04 MB)
• References

Free Access

An almost naive algorithm for finding relative neighbourhood graphs in $L_p$ metrics p. 199

Jyrki Katajainen and Olli Nevalainen

Published online: 01 February 2017

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

• Abstract
• PDF (1.25 MB)
• References