All times refer WEST (GMT+1), Porto local Time Zone
Monday, 16th
08:15 - 08:50
Registration
08:50 - 09:00
Opening Session
09:00 - 10:30
Session 1
Chair: Rogério Reis
09:00 - 09:30
(S16)
Amazigh Amrane and Nicolas Bedon
Equational Theories of Scattered and Countable Series-parallel Posets
09:30 - 10:00
(S23)
Pascal Caron, Edwin Hamel-de le Court and Jean-Gabriel Luque
A Study of a Simple Class of Modifiers: Product Modifiers
10:00 - 10:30
(S03)
Raphaela Löbel, Michael Luttenberger and Helmut Seidl
On the Balancedness of Tree-to-word Transducers
10:30 - 11:00
Coffee Break
11:00 - 12:30
Session 2
Chair: Sabine Broda
11:30 - 12:00
(S11)
Hyunjoon Cheon and Yo-Sub Han
12:00 - 12:30
(S13)
Kevin Stier and Andreas Maletti
On Tree Substitution Grammars
12:30 - 14:00
Lunch
14:00 - 16:00
Session 3
Chair: Martin Kutrib
14:00 - 14:30
(S20)
Andrea Frosini and Lama Tarsissi
The Characterization of Rational Numbers Belonging to a Minimal Path in the Stern-Brocot Tree According to a Second Order Balancedness
14:30 - 15:00
(S14)
Florian Lietard and Matthieu Rosenfeld
Avoidability of Additive Cubes over Alphabets of Four Numbers
15:00 - 15:30
(S01)
Augusto Modanese
15:30 - 16:00
(S02)
Raphaela Löbel, Michael Luttenberger and Helmut Seidl
Equivalence of Linear Tree Transducers with Output in the Free Group
16:00 - 16:30
Coffee Break
16:30 - 18:30
Session 4
Chair: Martin Kutrib
16:30 - 17:00
(S15)
Fabienne Chouraqui
17:30 - 18:00
(S19)
Florent Koechlin, Cyril Nicaud and Pablo Rotondo
On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations
18:00 - 18:30
(S22)
Daniel Průša and Michael Wehar
Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices
Tuesday, 17th
09:30 - 10:30
Session 5
Chair: Bruno Loff
09:30 - 10:30
(S06)
Michal Koucký
Computing Edit Distance
10:30 - 11:00
Coffee Break
11:00 - 12:30
Session 6
Chair: Bruno Loff
11:30 - 12:00
(D42)
Viktor Henriksson and Manfred Kufleitner
Deciding FO2 Alternation for Automata over Finite and Infinite Words
12:30 - 14:00
Lunch
14:00 - 15:30
Session 7
Chair: Jorge Almeida
14:00 - 15:00
(S09)
Benjamin Steinberg
Pointlike sets and separation: a personal perspective
15:00 - 15:30
(D40)
Elena Petrova and Arseny Shur
Branching Frequency and Markov Entropy of Repetition-Free Languages
15:30 - 16:00
Coffee Break
16:00 - 18:00
Session 8
Chair: Ondrej Klima
16:00 - 16:30
(D36)
Martin Kutrib and Uwe Meyer
Reversible Top-Down Syntax Analysis
16:30 - 17:00
(S18)
Oscar Ibarra, Jozef Jirásek, Ian McQuillan and Luca Prigioniero
Space Complexity of Stack Automata Models
17:00 - 17:30
(D39)
Luc Edixhoven and Sung-Shik Jongmans
17:30 - 18:00
(D33)
Volker Diekert, Henning Fernau and Petra Wolf
Wednesday, 18th
09:30 - 10:30
Session 9
Chair: Luca Prigioniero
10:00 - 10:30
(D13)
Weighted Prefix Normal Words: Mind the Gap
10:30 - 11:00
Coffee Break
11:00 - 12:30
Session 10
Chair: Luca Prigioniero
12:00 - 12:30
(D15)
Laura Ciobanu and Alan D. Logan
Variations on the Post Correspondence Problem for free groups
12:30 - 14:00
Lunch
14:00 - 15:30
Session 11
Chair: Nelma Moreira
14:00 - 15:00
(S05)
Alexandra Silva
Guarded Kleene Algebra with Tests
15:00 - 15:30
(D31)
Julian Pape-Lange
15:30 - 16:00
Coffee Break
16:00 - 18:00
Session 12
Chair: Henning Fernau
16:00 - 16:30
(D25)
Stijn Cambie, Michiel de Bondt and Henk Don
Extremal Binary PFAs in a Cerny Family
16:30 - 17:00
(S04)
Pamela Fleischmann, Marie Lejeune, Florin Manea, Dirk Nowotka and Michel Rigo
Reconstructing Words from Right-Bounded-Block Words
17:00 - 17:30
(D32)
Fabian Frei, Juraj Hromkovic, Rastislav Kralovic and Richard Kralovic
Two-Way Non-Uniform Finite Automata
17:30 - 18:00
(D19)
Stefan Hoffmann
Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata
Thursday, 19th
09:30 - 10:30
Session 13
Chair: Giovanni Pighizzini
09:30 - 10:30
(S07)
Henning Fernau
Parsimonious Computational Completeness
10:30 - 11:00
Coffee Break
11:00 - 12:30
Session 14
Chair: Giovanni Pighizzini
11:00 - 11:30
(D48)
Malte Blattmann and Andreas Maletti
11:30 - 12:00
(D26)
Reducing local alphabet size in recognizable picture languages
12:00 - 12:30
(D30)
Active Learning of Sequential Transducers with Side Information about the Domain
12:30 - 14:00
Lunch
14:00 - 15:30
Salomaa Prize Session
Chair: Mikhail Volkov
16:00 - 22:30
City Tour and Conference Dinner
Friday, 20th
09:00 - 10:30
Session 15
Chair: Sabine Broda
09:00 - 09:30
(D22)
Parikh Word Representable Graphs and Morphisms
09:30 - 10:00
(D24)
A strong non-overlapping Dyck code
10:00 - 10:30
(D02)
Definability Results for Top-Down Tree Transducers
10:30 - 11:00
Coffee Break
11:00 - 12:30
Session 16
Chair: Nelma Moreira
11:00 - 11:30
(D34)
Vesa Halava, Tero Harju, Reino Niskanen and Igor Potapov
Integer Weighted Automata on Infinite Words
11:30 - 12:00
(D03)
Dietrich Kuske
12:00 - 12:30
(D43)
Markus Holzer and Christian Rauch
The Range of State Complexities of Languages Resulting from the Cascade Product - The General Case
12:30 - 14:00
Lunch
14:00 - 15:30
Session 17
Chair: António Machiavelo
15:00 - 15:30
(S24)
Lukas Fleischer and Jeffrey Shallit
The State Complexity of Lexicographically Smallest Words and Computing Successors
15:30 - 16:00
Coffee Break
16:00 - 18:00
Session 18
Chair: António Machiavelo
16:00 - 16:30
(S21)
Mateus de Oliveira Oliveira and Michael Wehar
On the Fine Grained Complexity of Finite Automata Non-Emptiness of Intersection
16:30 - 17:00
(S17)
Laura Barker, Pamela Fleischmann, Katharina Harwardt, Florin Manea and Dirk Nowotka
Scattered Factor-Universality of Words
17:00 - 17:30
(D18)
Stefan Hoffmann
State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters
18:00 - 18:30
Closing Session