ZA+DKS: die Themen

Themen Proseminar

  • P1. Gajardo, Kari, Moreira (2012): Time-symmetry in CA
  • P2. Kari (1996): Representation of reversible cellular automata with block permutations
  • P3. Matamala (2003): Constructibility of speed one signal on cellular automata
  • P4. Maignan, Gruau (2008): Integer gradient for cellular automata: principle and examples
    Maignan, Gruau (2010): Convex Hulls on Cellular Automata
  • P5. Maignan, Gruau (2009): A 1D cellular automaton that moves particles until regular spatial placement
  • P6. Bandini et al. (2012): An analysis of different types and effects of asynchronicity in cellular automata update schemes
  • P7. Mazoyer (1996): On optimal solutions to the firing squad synchronization problem
  • P8. Umeo, Yanagihara (2011): Smallest Implementations of Optimum-Time Firing Squad Synchronization Algorithms for One-Bit-Communication Cellular Automata
  • P9. Yunes (2012): Grids and universal computations on one-dimensional cellular automata

Themen Hauptseminar

  • H1. Stout (1982,1983): clerks
    Grandjean et al. (2012): linear functional classes
  • H2. Arrighi et al. (2012): A simple block representation of reversible cellular automata with time-symmetry
  • H3. Arrighi, Dowek (2013): Causal graph dynamics
  • H4. quantum dot cellular automata

Date: 2013-04-16T11:57+0200

Author: Thomas Worsch

Org version 7.9.3f with Emacs version 24

Validate XHTML 1.0