RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 35 (2001) no. 4

Table of contents

Automata-based representations for infinite graphs

Torre, Salvatore La; Napoli, Margherita

p. 311-330

Towards parametrizing word equations

Abdulrab, H.; Goralčík, P.; Makanin, G. S.

p. 331-350

Maximal circular codes versus maximal codes

Guesnet, Yannick

p. 351-365

The helping hierarchy

Cintioli, Patrizio; Silvestri, Riccardo

p. 367-377

On the expressive power of the shuffle operator matched with intersection by regular sets

Jȩdrzejowicz, Joanna; Szepietowski, Andrzej

p. 379-388

Atoms and partial orders of infinite languages

Kuich, Werner; Sauer, N. W.

p. 389-401