CIAA 2017

22nd International Conference Implementation and Application of Automata

27--30 June 2017, Université Paris-Est Marne-la-Vallée

Program

Tuesday 27th

  • 9h30-10h: Welcome
  • 10h-11h: Invited talk: Damien Pous
  • 11h-11h30: Coffee break
  • 11h30-12h: Henning Bordihn and Markus Holzer. On the Number of Active States in Deterministic and Nondeterministic Finite Automata
  • 12h-12h30: Michal Hospodár, Galina Jirásková and Peter Mlynárčik. Nondeterministic Complexity of Operations on Free and Convex Languages
  • 12h30-14h: Lunch
  • 14h-14h30: Janusz Brzozowski and Corwin Sinnamon. Complexity of Proper Prefix-Convex Regular Languages
  • 14h30-15h: Robert Ferens and Marek Szykuła. Complexity of Regular Bifix-Free Languages
  • 15h-15h30: Marek Szykuła and John Wittnebel. Syntactic Complexity of Bifix-Free Languages
  • 15h30-16h: Coffee break
  • 16h-16h30: Andrew Ryzhikov. Synchronization Problems in Automata without Non-trivial Cycles
  • 16h30-17h: Claudia Cauli and Nir Piterman. Equivalence of Probabilistic $\mu$-calculus and p-Automata

Wenesday 28th

  • 9h30-10h30: Invited talk: Kim Larsen
  • 10h30-11h: Coffee break
  • 11h-11h30: Yo-Sub Han and Sang-Ki Ko.
    Alignment Distance of Regular Tree Languages
  • 11h30-12h: Martin Berglund, Brink van der Merwe, Bruce Watson and Nicolaas Weideman. On the Semantics of Atomic Subgroups in Practical Regular Expressions
  • 12h-12h30: Nathanaël Fijalkow, Hugo Gimbert, Edon Kelmendi and Denis Kuperberg. Stamina: Stabilisation Monoids IN Automata theory.
  • 12h30-14h: Lunch
  • 14h-15h30: Tool session
  • 15h30-16h: Coffee Break
  • 16h-17h: Tool session

Thursday 29th

  • 9h30-10h30 Invited talk: Véronique Cortier
  • 10h30-11h: Coffee break
  • 11h-11h30: Martin Kutrib, Andreas Malcher and Matthias Wendlandt. Transducing Reversibly with Finite State Machines
  • 11h30-12h: Sylvain Lombardy and Louis-Marie Dando. From Hadamard Expressions to Weighted Rotating Automata and Back
  • 12h-12h30: Business meeting
  • 12h30-14h: Lunch
  • 14h-18h: Social event
  • 19>h30-22h: Conference diner

Friday 30th

  • 9h30-10h Antonis Achilleos, Luca Aceto, Anna Ingolfsdottir, Adrian Francalanza and Saevar Orn Kjartansson. On the Complexity of Determinizing Monitors
  • 10h-10h30: Stefan Gerdjikov, Stoyan Mihov and Klaus Schulz. A simple method for building bimachines from functional finite-state transducers.
  • 10h30-11h: Coffee break
  • 11h-11h30: Henrik Björklund, Johanna Björklund and Petter Ericson. On the Regularity and Learnability of Ordered DAG Languages
  • 11h-11h30: Paolo Massazza. On the conjecture L_DFCM \subset RCM
  • 11h30-12h: Henning Fernau, Lakshmanan Kuppusamy and Indhumathi Raman. Computational Completeness of Path-Structured Graph-Controlled Insertion-Deletion Systems
  • 12h30-14h: Lunch
  • 14h: End of CIAA 2017