RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 41 (2007) no. 2

Table of contents

Balance properties of the fixed point of the substitution associated to quadratic simple Pisot numbers

Turek, Ondřej

p. 123-135

Returning and non-returning parallel communicating finite automata are equivalent

Choudhary, Ashish; Krithivasan, Kamala; Mitrana, Victor

p. 137-145

An algorithm for deciding if a polyomino tiles the plane

Gambini, Ian; Vuillon, Laurent

p. 147-155

Sequential monotonicity for restarting automata

Jurdziński, Tomasz; Otto, Friedrich

p. 157-175

Three notes on the complexity of model checking fixpoint logic with chop

Lange, Martin

p. 177-190

Object oriented institutions to specify symbolic computation systems

Domínguez, César; Lambán, Laureano; Rubio, Julio

p. 191-214

A periodicity property of iterated morphisms

Honkala, Juha

p. 215-223

Deciding inclusion of set constants over infinite non-strict data structures

Schmidt-Schauss, Manfred; Sabel, David; Schütz, Marko

p. 225-241