CIAA 2012

17th International Conference on Implementation and Application of Automata

Provisional Program

Tuesday, July 17

08:30 - 09:30
Registration
09:30 - 10:00
Welcoming
10:00 - 11:00
Invited Talk: "In Search of Most Complex Regular Languages" - Janusz Brzozowski
11:00 - 11:30
Coffee break
11:30 - 12:30
"Implementing Computations in Automaton (Semi)groups" - Ines Klimann, Jean Mairesse and Matthieu Picantin
"Regular Ideal Languages and Their Boolean Combinations" - Franz Jahn, Manfred Kufleitner and Alexander Lauser
12:30 - 14:00
Lunch
14:00 - 15:00
"A Pushdown Transducer Extension for the OpenFst Library" - Cyril Allauzen and Michael Riley
"A Disambiguation Algorithm for Finite Automata and Functional Transducers" - Mehryar Mohri
15:00 - 16:00
Invited Talk: "In Memoriam Sheng Yu" - Kai Salomaa
16:00 - 16:30
Coffee break
16:30 - 18:00
"On the State and Computational Complexity of the Reverse of Acyclic MinimalDFAs" - Galina Jirásková and Tomáš Masopust
Hyper-Minimization for Deterministic Tree Automata" - Artur Jeiż and Andreas Maletti
"Restarting Tiling Automata" - Daniel Průša and František Mráz
18:00 - 19:30
Social Program: Reception

--------------------------------------------------------
Wednesday, July 18

09:00 - 09:30
"Synchronizing Automata on Quasi Eulerian Digraph" - Mikhail Berlinkov
09:30 - 10:30
Invited Talk: "A Formal Framework for Processes Inspired by the Functioning of LivingCells" - Grzegorz Rozenberg
10:30 - 11:00
Coffee break
11:00 - 12:30
"P(l)aying for Synchronization" - Fedor Fominykh and Mikhail Volkov
"Synchronizing Automata of Bounded Rank" - Vladimir Gusev
"Synchronization of Automata with one Undefined or Ambiguous Transition" - Martyugin Pavel
12:30 - 14:00
Lunch
14:00 - 16:00
"Factor and Subsequence Kernels and Signatures of Rational Languages" - Ahmed Amarni and Sylvain Lombardy
"The removal of weighted epsilon-transitions" - Sylvain Lombardy and Jacques Sakarovitch
"Weighted LTL with Discounting" - Eleni Mandrali
"A Fast Suffix Automata Based Algorithm for Exact Online String Matching" - Simone Faro and Thierry Lecroq
"Strict Local Testability with Consensus Equals Regularity" - Stefano Crespi Reghizzi and Pierluigi San Pietro
16:00 - 16:30
Coffee break
16:30 - 18:00
Demos session #1

Grail+/MiniGrail
Vaucanson
FAdo
PAPAGENO
Spot

--------------------------------------------------------
Thursday, July 19

09:00 - 09:30
"Automatic Theorem-Proving in Combinatorics on Words" - Dane Henshall, Jeffrey Shallit and Daniel Goč
09:30 - 10:30
Invited Talk: "Typed Linear Algebra for Weighted (probabilistic) automata" - José N. Oliveira
10:30 - 11:00
Coffee break
11:00 - 12:30
"Crossing the Syntactic Barrier: Hom-Disequalities for H1-Clauses" - Andreas Reuß and Helmut Seidl
"On the Descriptional Complexity of the Window Size for Deterministic RestartingAutomata" - Martin Kutrib and Friedrich Otto
"Weak Inclusion for Recursive XML Types" - Joshua Amavi, Jacques Chabin and Pierre Réty
12:30 - 14:00
Lunch
14:00 - 20:00
Social Program - TBA
20:00 -
Social Program: Conference Banquet

--------------------------------------------------------
Friday, July 20

09:00 - 09:30
"How to Synchronize the Heads of a Multitape Automaton" - Oscar Ibarra and Nicholas Tran
09:30 - 10:30
Invited Talk: "Adding Pebbles to Weighted Automata" - Paul Gastin
10:30 - 11:00
Coffee break
11:00 - 12:30
"Nominal Automata for Resource Usage Control" - Pierpaolo Degano, Gianluigi Ferrari and Gianluca Mezzetti
"Weighted Nested Word Automata and Logics over Strong Bimonoids" - Manfred Droste and Bundit Pibaljommee
"Cellular Automata on Regular Rooted Trees" - Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi and Zoran Sǔníc
12:30 - 14:00
Lunch
14:00 - 14:40
Business Meeting
14:40 - 16:00
"On Positive TAGED with a Bounded Number of Constraints" - Pierre-Cyrille Héam, Vincent Hugot and Olga Kouchnarenkoe
"Automata with Modulo Counters and Nondeterministic Counter Bounds" - Daniel Reidenbach and Markus L. Schmid
"Multi-Tilde-Bar Expressions and their Derivatives" - Pascal Caron, Jean-Marc Champarnaud and Ludovic Mignot
"SDFA: Series DFA for Memory-Efficient Regular Expression Matching" - Tingwen Liu, Yong Sun, Li Guo and Binxing Fang
16:00 - 16:30
Coffee break
16:30 - 18:00
Demos session #2

I-LaSer
LISA
libFAUDES
XMLCorrector
T3S-Tool
DesCo