---

Theoretical Informatics and Applications

Vol. 41 No. 2 (April-June 2007)

• Balance properties of the fixed point of the substitution associated to quadratic simple Pisot numbers     p. 123
  Ondrej Turek
  Abstract | PDF file (173.4 KB) | References



• Returning and non-returning parallel communicating finite automata are equivalent     p. 137
  Ashish Choudhary, Kamala Krithivasan and Victor Mitrana
  Abstract | PDF file (117.2 KB) | References



• An algorithm for deciding if a polyomino tiles the plane     p. 147
  Ian Gambini and Laurent Vuillon
  Abstract | PDF file (139.5 KB) | References



• Sequential monotonicity for restarting automata     p. 157
  Tomasz Jurdzinski and Friedrich Otto
  Abstract | PDF file (240.9 KB) | References



• Three notes on the complexity of model checking fixpoint logic with chop     p. 177
  Martin Lange
  Abstract | PDF file (190.4 KB) | References



• Object oriented institutions to specify symbolic computation systems     p. 191
  César Domínguez, Laureano Lambán and Julio Rubio
  Abstract | PDF file (274.2 KB) | References



• A periodicity property of iterated morphisms     p. 215
  Juha Honkala
  Abstract | PDF file (130.2 KB) | References



• Deciding inclusion of set constants over infinite non-strict data structures     p. 225
  Manfred Schmidt-Schauss, David Sabel and Marko Schütz
  Abstract | PDF file (211.9 KB) | References

---

© EDP Sciences 2007