DLT 2022

Program

All talks will be in ISA 1051 (see the ).

See the abstracts for the invited talks in the conference brochure.

Monday, May 9
1:00pm-1:50pm Registration
1:50pm-2:00pm Opening
2:00pm-3:00pm Jarkko Kari
Algebraic methods for periodicity in multidimensional symbolic dynamics
3:00pm-3:30pm Coffee break
3:30pm-4:00pm Michel Rigo, Manon Stipulanti and Markus Whiteland
Binomial complexities and Parikh-collinear morphisms
4:00pm-4:30pm

脡milie Charlier, C茅lia Cisternino and Manon Stipulanti
A full characterization of Bertrand numeration systems
4:30pm-5:00pm Dora Bulgakova, Anna Frid and J茅r茅my Scanvic
Prefix palindromic length of the Sierpinski word
Tuesday, May 10
9:00am-9:30am Breakfast
9:30am-10:30am Volodymyr Nekrashevych
Non-deterministic transducers
10:30am-11:00am Coffee break
11:00am-11:30am Florian Stober and Armin Weiss
The power word problem in graph products
11:30am-12:00pm 窜辞谤补苍&苍产蝉辫;艩耻苍颈膰
On one-counter positive cones of free groups
12:00pm-12:30pm

Stefan Hoffmann
Automata-theoretical regularity characterizations for the Iterated shuffle on commutative regular languages
 12:30pm-2:00pm Lunch break
2:00pm-3:00pm Delaram Kahrobaei
Group-based cryptography in the quantum era
3:00pm-3:30pm Coffee break
3:30pm-4:00pm Ondrej Klima and Jonatan Kolegar
Well quasi-orders arising from finite ordered semigroups
4:00pm-4:30pm Aistis Atminas and Vadim Lozin
Deciding atomicity of subword-closed languages
Online talk:
4:30pm-5:00pm Szymon 艁opaciuk and Daniel Reidenbach
The Billaud conjecture for 触鈭憒=4, and beyond
5:00pm-7:00pm Reception / Poster session
Wednesday, May 11
9:00am-9:30am Breakfast
9:30am-10:30am Paula Bonizzoni
How can formal languages help pangenomics?
10:30am-11:00am

Tomoyuki Yamakami
Kolmogorov complexity descriptions of the exquisite behaviors of advised deterministic pushdown automata
Online talk:

11:00am-11:30am Coffee break
11:30am-12:00pm C. Aiswarya, Sahil Mhaskar and M. Praveen
Checking regular invariance under tightly-controlled string modifications
Online talk:
12:00pm-12:30pm Hyunjoon Cheon, Joonghyuk Hahn and Yo-Sub Han
On the decidability of infix inclusion problem
12:30pm-1:00pm Francesco Dolce and Pierre-Adrien Tahay
Column representation of Sturmian words in cellular automata
1:00pm-2:00pm Lunch
  Free afternoon
Thursday, May 12
10:00am-10:30am

Mikhail Volkov
Announcement of awards: Salomaa prize and best paper award
Online Access:

10:30am-11:00am Jozef Jirasek and Ian McQuillan
Visit-bounded stack automata
11:00am-11:30am Coffee break
11:30am-12:00pm Giovanni Pighizzini, Luca Prigioniero and 艩imon S谩dovsk媒
Performing regular operations with 1-limited automata
12:00pm-12:30pm Andrea Frosini, Ilaria Mancini, Simone Rinaldi, Giuseppe Romana and Marinella Sciortino
Logarithmic equal-letter runs for BWT of purely morphic words
 12:30pm-2:00pm Lunch break
2:00pm-3:00pm Joel Day
Word equations in the context of string solving
3:00pm-3:30pm Coffee break
3:30pm-4:00pm Ryoma Sin'Ya
Measuring power of locally testable languages
4:00pm-4:30pm Elias Heikkil盲, Pyry Herva and Jarkko Kari
On perfect coverings of two-dimensional grids
4:30pm-5:00pm Oscar Ibarra and Ian McQuillan
On the complexity of decision problems for counter machines with applications to coding theory
Online talk:
7:00pm-10:00pm Conference dinner
Friday, May 13
9:00am-9:30am Breakfast
9:30am-10:30am Helmut Seidl
Origin equivalence for macro tree transducers
Online talk:
10:30am-11:00am Coffee break
11:00am-11:30am Ekaterina Shemetova, Alexander Okhotin and Semyon Grigorev
Rational index of languages with bounded dimension of parse trees
Online talk:
11:30am-12:00pm Andreas Maletti and Andreea-Teodora N谩sz 
Weighted tree automata with constraints
12:00pm-12:30pm Olivier Carton
Preservation of normality by unambiguous transducers