Wednesday, september 19
8h15-9h00– Registration
9h00-9h10– Opening
Invited Talk (Chair: B. Martin)
- 9h10-10h10: E. Goles. The complexity of some automata networks
10h10-10h30– Coffee Break
Stochastic CAs (Chair: A. Shen)
- 10h30-11h00: P. Arrighi, N. Schabanel and G. Theyssier. Intrinsic simulations between stochastic CAs
- 11h00-11h15: S. Sené. A necessary condition for boundary sensitivity of attractive non-linear stochastic CAs in ZxZ
- 11h15-11h30: N. Fatčs. A note on the density classification problem in two dimensions
- 11h30-11h45: H. Nishio. Information dynamics of CAs II - a probabilistic study
12h-14h– Lunch
Invited Talk (Chair: M. Kutrib)
- 14h-15h: G. Pighizzini. Two-way finite automata: old and recent results
Asynchronous and Non Uniform CAs (Chair: N. Fates)
- 15h00-15h30: S. Wacker and T. Worsch. Phase space invertible asynchronous CAs
- 15h30-16h00: M. Vielhaber. Computing by temporal order: asynchronous CAs
- 16h00-16h15: N. Naskar and S. Das. Characterization of non-uniform CAs having only two point states 0n and 1n
16h15-16h30– Coffee Break
Topological Properties (Chair: E. Jeandel)
- 16h30-17h00: A. Shen and A. Romashchenko. Topological arguments for Kolmogorov complexity.
- 17h00-17h30: I. Törmä and V. Salo. Topology inspired problems for CAs, and a counterexample in topology
- 17h30-18h00: G. Fici and F. Fiorenzi. Topological properties of CAs on trees
Dinner
Thursday, september 20
Invited Lecture I (Chair: J. Cervelle)
- 9h-10h30: P. Kurka. Attractors in CAs
10h30-10h45– Coffee Break
Tilings (Chair: J. Kari)
- 10h45-11h15: K. Imai, T. Hatsuda, V. Poupet and K. Sato. A universal semi-totalistic CA on Kite and Dart Penrose tilings
- 11h15-11h45: E. Jeandel and N. Rolin. Fixed parameter undecidability for Wang tilesets
- 11h45-12h15: T. Fernique and M. Sablik. Local rules for computable planar tilings
12h15-14h15– Lunch
Universality & Complexity (Chair: N. Ollinger)
- 14h15-14h45: K. Morita. Universality of one-dimensional reversible and number-conserving CAs
- 14h45-15h15: M. Kutrib and A. Malcher. Transductions computed by one-dimensional CAs
- 15h15-15h45: A. Grandjean, G. Richard and V. Terrier. Linear functional classes over CAs
- 15h45-16h00: T. Worsch. (Intrinsically?) Universal asynchronous CAs II
16h-16h15– Coffee Break
Algorithmic (Chair : P. de Oliveira)
- 16h15-16h45: H. Umeo. A simple optimum-time FSSP algorithm for multi-dimensional CAs
- 16h45-17h00: M. Carneiro and G. M. B. Oliveira. Synchronous CAs-based scheduler with construction heuristic to static task scheduling in multiprocessors
- 17h00-17h15: N. Bacquey. The packing problem: a divide and conquer algorithm on CAs
- 17h15-17h30: J-V. Millo and R. de Simone. Refining CAs with routing constraints
Parity Problem & Spectral Analysis (Chair: H. Umeo)
- 17h30-18h00: H. Betel, P. Flocchini and P. de Oliveira. On the parity problem in one-dimensional CAs
- 18h00-18h15: S. Ninagawa. Solving the parity problem with elementary CA rule 60
- 18h15-18h30: E. Ruivo and P. de Oliveira. Spectral similarity among elementary CAs
18h30– WG 1.5 Business Meeting
Gala Dinner
Friday, september 21
Invited Lecture II (Chair: J. Cervelle)
- 9h-10h30: P. Kurka. Signals in CAs
10h30-10h45– Coffee Break
Dynamical Properties I (Chair: K. Morita)
- 10h45-11h15: A. Dennunzio, P. Di Lena and L. Margara. Strictly periodic points in CAs
- 11h15-11h45: B. Hellouin De Menibus and M. Sablik. Entry times in automata with simple defect dynamics
- 11h45-12h15: I. Törmä and V. Salo. On derivatives and subpattern orders of countable subshifts
12h15-14h15– Lunch
Dynamical Properties II (Chair: T. Worsch)
- 14h15-14h45: V. Salo. On nilpotency and asymptotic nilpotency of CAs
- 14h45-15h15: M. Noual, D. Regnault and S. Sené. Boolean networks synchronism sensitivity and XOR circulant networks convergence time
- 15h15-15h30: F. García-Ramos. Local periodicity and mu-equicontinuity in CAs
15h30– Closing
Site info
© 2011-2012 Automata 2012 | Generated by webgen | Design by A. Viklund.