You can download the pdf version of the program here.
An electronic version of the proceedings is available for conference participants here.
| Thursday 28/06 |
Friday, 29/06 |
Saturday 30/06 |
|
| 9:00 | Registration | Invited 3 (M. Raynal) | Invited 5 (R. Freund) |
| 09:15 | |||
| 09:30 | Invited 1 (D. Woods) | ||
| 09:45 | |||
| 10:00 | Coffee Break | Coffee Break | |
| 10:15 | |||
| 10:30 | Coffee Break | Talk 1 | Talk 6 |
| 10:45 | |||
| 11:00 | Invited 2 (E. Csuhaj-Varju) |
||
| 11:15 | Talk 2 | Talk 7 | |
| 11:30 | |||
| 11:45 | |||
| 12:00 | Lunch | Closing | |
| 12:15 | |||
| 12:30 | Lunch | Lunch | |
| 12:45 | |||
| 13:00 | |||
| 13:15 | |||
| 13:30 | |||
| 13:45 | |||
| 14:00 | Social program | Invited 4 (N. Jonoska) | |
| 14:15 | |||
| 14:30 | |||
| 14:45 | |||
| 15:00 | Coffee Break | ||
| 15:15 | |||
| 15:30 | Talk 3 | ||
| 15:45 | |||
| 16:00 | |||
| 16:15 | Talk 4 | ||
| 16:30 | |||
| 16:45 | |||
| 17:00 | Talk 5 | ||
| 17:15 | |||
| 17:30 | |||
| Talk 1 | Cosmin Bonchis, Gabriel Istrate and Vlad Rochian. The language (and series) of Hammersley-type processes |
||||
| Talk 2 | Sándor Vályi and Benedek Nagy. An extension of interval-valued computing equivalent to red-green Turing machines |
||||
| Talk 3 | Viliam Geffert and Zuzana Bednarova. Minimal Useful Size of Counters for (Real-Time) Multicounter Automata |
||||
| Talk 4 | Richard Whyman. Physical Computation and First-Order Logic |
||||
| Talk 5 | Pacôme Perrotin, Sylvain Sené and Kévin Perrot. A framework for (de)composing with Boolean automata networks |
||||
| Talk 6 | Artiom Alhazov, Rudolf Freund and Sergiu Ivanov. Sequential Grammars with Activation and Blocking of Rules |
||||
| Talk 7 | Henning Fernau, Lakshmanan Kuppusamy, Rufus Oladele and Indhumathi Raman. Minimizing Rules and Nonterminals in Semi-conditional Grammars: Non-trivial for the Simple Case |
||||