Tome 35 (2001) no. 4

Sommaire

Automata-based representations for infinite graphs
p. 311-330
Towards parametrizing word equations
p. 331-350
Maximal circular codes versus maximal codes
p. 351-365
The helping hierarchy
p. 367-377
On the expressive power of the shuffle operator matched with intersection by regular sets
p. 379-388
Atoms and partial orders of infinite languages
p. 389-401