A Lower Bound For Reversible Automata p. 331 Pierre-Cyrille Héam Published online: 15 April 2002 DOI: https://doi.org/10.1051/ita:2000120 AbstractPDF (155.9 KB)References
Return words in Sturmian and episturmian words p. 343 Jacques Justin and Laurent Vuillon Published online: 15 April 2002 DOI: https://doi.org/10.1051/ita:2000121 AbstractPDF (180.8 KB)References
A Space Lower Bound for Acceptance by One-Way Π2-Alternating Machines p. 357 Viliam Geffert and Norbert Popély Published online: 15 April 2002 DOI: https://doi.org/10.1051/ita:2000101 AbstractPDF (223.9 KB)References
On a paper by Castelli, Mignosi, Restivo p. 373 Jacques Justin Published online: 15 April 2002 DOI: https://doi.org/10.1051/ita:2000122 AbstractPDF (108.3 KB)References
Local Transition Functions of Quantum Turing Machines p. 379 Masanao Ozawa and Harumichi Nishimura Published online: 15 April 2002 DOI: https://doi.org/10.1051/ita:2000123 AbstractPDF (223.4 KB)References
Complexité et automates cellulaires linéaires p. 403 Valérie Berthé Published online: 15 April 2002 DOI: https://doi.org/10.1051/ita:2000124 AbstractPDF (213.2 KB)References