Programme

The programme is available for downloading now in .pdf:
- A4 format - 5 pages or
- leaflet format (print in duplex and landscape)

 

Thursday,March13

8:00 – 9:00

Registration

9:00 – 9:15

Opening

9:15 – 10:45
Zoltán Ésik

JARKKO KARI: Cellular Automata (I) – Tutorial

10:45 – 11:15

Coffee Break

11:15 – 12:45
Volker Diekert

ARTO SALOMAA, KAI SALOMAA and SHENG YU: Length Codes, Products of Languages and Primality

MATHIEU GIRAUD: Not So Many Runs in Strings

WŁODZIMIERZ MOCZURAD and MAŁGORZATA MOCZURAD: How Many Figure Sets Are Codes?

12:45 – 13:00

Break

13:00 – 14:00
Martin Plátek

JAN­HENRIK ALTENBERND: On Bifix Systems and Generalizations

MARTIN KORP and AART MIDDELDORP: Match­Bounds with Dependency Pairs for Proving Termination of Rewrite Systems

14:00 – 16:00

Lunch

16:00 – 17:30
Stefano Crespi Reghizzi

ALEXANDER KRASSOVITSKIY, YURII ROGOZHIN and SERGEY VERLAN: Further Results on Insertion­Deletion Systems with One­sided Contexts

PETER LEUPOLD: On Regularity­Preservation by String­Rewriting Systems

FRIEDRICH OTTO and MARTIN PLÁTEK: A Two­Dimensional Taxonomy of Proper Languages of Lexicalized FRR­Automata

17:30 – 18:00

Coffee Break

18:00 – 19:30
Sheng Yu

FRIEDRICH OTTO and ETSURO MORIYA: On Alternating Non­Context­Free Grammars

JÜRGEN DASSOW and SHERZOD TURAEV: k­Petri Net Controlled Gram­mars

ALEXANDER PEREKRESTENKO: Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP­hard

 


Rectorate Building of the University

 

Friday,March14

8:45 – 10:15
Zoltán Ésik

JARKKO KARI: Cellular Automata (II) – Tutorial

10:15 – 10:45

Coffee Break

10:45 – 12:15
Jarkko Kari

PABLO ARRIGHI, VINCENT NESME and REINHARD WERNER: One­dimensional Quantum Cellular Automata over Finite, Unbounded Configura­tions

DAMIEN REGNAULT, NICOLAS SCHABANEL and ERIC THIERRY: On the Analysis of ‘Simple’ 2D Stochastic Cellular Automata

SILVIO CAPOBIANCO: Induced Subshifts and Cellular Automata

12:15 – 12:30

Break

12:30 – 14:00
Holger Petersen

LAURA KALLMEYER and YANNICK PARMENTIER: On the Relation between Multicomponent Tree Adjoining Grammars with Tree Tuples (TT­MCTAG) and Range Concatenation Grammars (RCG)

LE HONG PHUONG, AZIM ROUSSANALY, THI MINH HUYEN NGUYEN and TUONG VINH HO: A Hybrid Approach to Word Segmentation of Viet­namese Texts

DENIS BECHET, ALEXANDER DIKOVSKY, ANNIE FORET and EM­MANUELLE GAREL: Optional and Iterated Types for Pregroup Grammars

14:00 – 16:00

Lunch

16:00 – 17:30
Mikołaj Bojanczyk

ANDREAS MALETTI: Minimizing Deterministic Weighted Tree Automata

JÉRÔME CHAMPAVÈRE, RÉMI GILLERON, AURÉLIEN LEMAY AND JOACHIM NIEHREN: Efficient Inclusion Checking for Deterministic Tree Au­tomata and DTDs

ARTIOM ALHAZOV, ERZSÉBET CSUHAJ­VARJÚ, CARLOS MARTÍN­VIDE AND YURII ROGOZHIN: About Universal Hybrid Networks of Evolutionary Processors of Small Size

17:30 – 18:00

Coffee Break

18:00 – 19:00
Friedrich Otto

MIKOLAJ BOJANCZYK: Tree­walking Automata – Invited Talk

19:30

Visit to the Old City

 


Circ Romà

 

Saturday,March15

10:00 – 13:30

Diploma Estudis Avançats (DEA Exams for both PhD schools Formal Languages and Applications and Language and Speech Technologies)

10:00 – 11:00
Carlos Martín Vide

Language and Speech Technologies

MOHAMMED MEDIANI

UDOCHUKWU OGBUREKE

11:00 – 11:15

Break

11:15 – 13:15
Carlos Martín Vide

Formal Languages and Applications

LUIS ASTORGA

GÁBOR BALÁZSFALVI

ZOLTÁN PÁL MECSEI

ROBERT MERCAS¸

 

Sunday,March16

9:00 – 18:00

Conference Trip with Calçotada

 


Calçotada

 

Monday,March17

9:15 – 10:45
Jorge Almeida

MIKHAIL VOLKOV: Synchronizing Automata (I) – Tutorial

10:45 – 11:15

Coffee Break

11:15 – 12:45
Mikhail Volkov

HENNING BORDIHN and MARKUS HOLZER: Random Context in Regulated Rewriting Versus Cooperating Distributed Grammar Systems

SUNA BENSCH, HENNING BORDIHN, MARKUS HOLZER and MARTIN KUTRIB: Deterministic Input­Reversal and Input­Revolving Finite Automata

PAWEL GAWRYCHOWSKI and ANDRZEJ KISIELEWICZ: 2­Synchronizing Words

12:45 – 13:00

Break

13:00 – 14:00
Yurii Rogozhin

STEFANO CRESPI REGHIZZI and PIERLUIGI SAN PIETRO: Consensual Def­inition of Languages by Regular Sets

BARBARA KLUNDER: Characterization of Star­Connected Languages Using Finite Automata

14:00 – 16:00

Lunch

16:00 – 17:30
Michael Domaratzki

ROBERT BRIJDER and HENDRIK JAN HOOGEBOOM: Extending the Overlap Graph for Gene Assembly in Ciliates

FLORENT BECKER: Transformations and Preservation of Self­assembly Dy­namics through Homotheties

OZAN KAHRAMANOGULLARI: On Linear Logic Planning and Concurrency

17:30 – 18:00

Coffee Break

18:00 – 19:00
Markus Holzer

MICHAEL DOMARATZKI: Formal Language Tools for Template­guided DNA Recombination – Invited Talk

19:30

Visit to the City Hall

 

City Hall of Tarragona Inner Courtyard

 

Tuesday,March18

9:15 – 10:45
Jorge Almeida

MIKHAIL VOLKOV: Synchronizing Automata (II) – Tutorial

10:45 – 11:15

Coffee Break

11:15 – 12:45
Benjamin Steinberg

ELAINE RENDER and MARK KAMBITES: Polycyclic and Bicyclic Valence Au­tomata

ALAN J. CAIN, GRAHAM P. OLIVER, NIK RUSKUC and RICK THOMAS: Automatic Presentations for Cancellative Semigroups

ONDREJ KLIMA and LIBOR POLÁK: Literal Varieties of Languages Induced by Homomorphisms onto Nilpotent Groups

12:45 – 13:00

Break

13:00 – 14:00
Henning Bordihn

SERGEY KITAEV, TOUFIK MANSOUR and PATRICE SÉÉBOLD: Counting Ordered Patterns in Words Generated by Morphisms

SVETLANA PUZYNINA: On Periodicity of Generalized Two­dimensional Words

14:00 – 16:00

Lunch

16:00 – 17:30
Martin Kutrib

RYO YOSHINAKA: An Efficient Algorithm for the Inclusion Problem of a Sub­class of DPDAs

GIUSI CASTIGLIONE, ANTONIO RESTIVO AND MARINELLA SCIORTINO: Hopcrofts Algorithm and Cyclic Automata

CLAUDE KIRCHNER, RADU KOPETZ and PIERRE­ETIENNE MOREAU: Anti­Pattern Matching Modulo

17:30 – 18:00

Coffee Break

18:00 – 19:00
Jörg Flum

BENJAMIN STEINBERG: Marked Products of Languages and Matrix Represen­tations – Invited Talk

 


Cathedral of Tarragona

 

Wednesday,March19

9:15 – 10:45
Jorge Almeida

MIKHAIL VOLKOV: Synchronizing Automata (III) – Tutorial

10:45 – 11:15

Coffee Break

11:15 – 12:15
Bianca Truthe

TERRY ANDERSON, NARAD RAMPERSAD, NICOLAE SANTEAN and JEF­FREY SHALLIT: Finite Automata, Palindromes, Powers, and Patterns

DOROTHEA BAUMEISTER and J ¨ ORG ROTHE: The Three­Color and Two­Color Tantrix(TM) Rotation Puzzle Problems Are NP­Complete via Parsimonious Reductions

12:15 – 12:30

Break

12:30 – 13:30
Remco Loos

MARK MERCER: Lower Bounds for Generalized Quantum Finite Automata

HOLGER PETERSEN: Sorting and Element Distinctness on One­Way Turing Machines

13:30

Closing

 

We acknowledge the support by: