Tome 41 (2007) no. 2

Sommaire

Balance properties of the fixed point of the substitution associated to quadratic simple Pisot numbers
p. 123-135
Returning and non-returning parallel communicating finite automata are equivalent
p. 137-145
An algorithm for deciding if a polyomino tiles the plane
p. 147-155
Sequential monotonicity for restarting automata
p. 157-175
Three notes on the complexity of model checking fixpoint logic with chop
p. 177-190
Object oriented institutions to specify symbolic computation systems
p. 191-214
A periodicity property of iterated morphisms
p. 215-223
Deciding inclusion of set constants over infinite non-strict data structures
p. 225-241