TENTATIVE CONFERENCE PROGRAM

 

Wednesday, August 17

 
 
10.00 - 14.30
Registration, lunch
14.30 - 14.35
Opening of AFL 2011
 
 
  Session chair:   Zoltán Ésik 

14.35 - 15.35
Jean-Eric Pin (invited talk) : Equational descriptions of languages 
15.35 - 16.00
Janusz Brzozowski and Bo Liu : Quotient Complexity of Star-Free Languages 
 
 
16.00 - 16.30
Break
 
 Session chair:   Janusz Brzozowski 

16.30 - 16.55
Manfred Kufleitner and Alexander Lauser : Around Dot-depth One 
16.55 - 17.20
Antonio Cano and Eija Jurvanen: Varieties of Languages and Frontier Check 
 
 
19.00
Welcome party  
 
  

Thursday, August 18

 
 Session chair:  Giovanni Pighizzini     

  9.00 - 10.00
Masami Ito (invited talk) : K-Restricted Duplication Closure of Languages
10.00 - 10.25
Xiaoxue Piao, Kai Salomaa and Sandor Vagvolgyi : Tree Homomorphisms for Unranked Trees 
 
 
10.25 - 10.55
Break
 
 
 Session chair:   Zoltán Fülöp

10.55 - 11.20
Janusz Brzozowski, Galina Jiraskova, Baiyu Li and Joshua Smith : Quotient Complexity of Bifix-, Factor-, and Subword-Free Languages
11.20 - 11.45
Alexander Meduna, Lukáš Vrábel and Petr Zemek : On Nondeterminism in Programmed Grammars 
11.45 - 12.10
Szabolcs Iván and Ágnes Mészáros : On Muller Context-free Grammars Generating Well-ordered Words 
 
12.10 - 14.00
Lunch 
 
 
Session chair:   Werner Kuich 

14.00 - 14.25
Oscar Ibarra and Shinnosuke Seki : Characterizations of Bounded Semilinear Languages by One-way and Two-way Deterministic Machines
14.25 - 14.50
Andreas Maletti and Daniel Quernheim : Hyper-minimisation of deterministic weighted finite automata over semifields
14.50 - 15.15
Martin Čermák and Alexander Meduna : n-Accepting Restricted Pushdown Automata Systems 
15.15 - 15.40
Markus Holzer, Sebastian Jakobi and Martin Kutrib : The Chop of Languages
 
 
15.40 - 16.10
Break
 
 
 Session chair: Hiroshi Umeo
16.10 - 16.35
Venkata Krishna Kanduru and T. K. Pramod Vedala : Towards Shortest Reset Words in Polynomial Time
16.35 - 17.00
Lila Kari and Zhi Xu : De Bruijn Sequences Revisited
17.00 – 17.25
Szilard Zsolt Fazekas, Peter Leupold and Kayoko Shikishima-Tsuji : Avoidability of Primitive Palindromes 
 
  

Friday, August 19



Session chair:   Matrin Kutrib

  9.00 - 10.00
Andreas Maletti (invited talk) : Hyper-minimization --- Lossy compression of deterministic automata
10.00 - 10.25
Gilles Benattar, Beatrice Berard, Didier Lime, John Mullins, Olivier H. Roux and Mathieu Sassolas : Channel Synthesis for Finite Transducers
 
 
10.25 - 10.55
Break
 

Session chair:  Erzsébet Csuhaj-Varjú  

10.55 - 11.20
Benedek Nagy and Friedrich Otto : Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata
11.20 - 11.45
M. Dolores Jimenez-Lopez, Gemma Bel-Enguix and Adela Grando : Grammar Systems as Orchestras of Grammatical Services 
11.45 - 12.10
Florin Manea and Bianca Truthe : Accepting Networks of Evolutionary Processors with Subregular Filters
 
 
12.10 
Lunch 
 
 
15.00
Excursion 
Sightseeing tour in Hortobágy
Conference Dinner 
 
  

Saturday, August 20

 
8:00 FLOWER FESTIVAL 
 
 

Sunday, August 21

 
Session chair:   to be announced later   
 
10.30– 12.10
Birthday  Celebrations


 
12.10– 14.00
Lunch
 
 Session chair: Libor Polák
 
14.00 - 15.00

Christian Choffrut (invited talk) : n-ary Relations of Finite Words
over Infinite Alphabets

15.00-15.25
Hiroshi Umeo : Recent Developments in Firing Squad Synchronization Algorithms for Two-Dimensional Cellular Automata and Their State-Efficient Implementations
15.55-16.20
Stefan Borgwardt and Rafael Peñaloza : The Inclusion Problem for Weighted Automata on Infinite Trees
 
 

Monday, August 22




 Session chair:  Fridrich Otto
 
  9.00 - 10.00
Francine Blanchet-Sadri  (invited talk) : Algorithmic Combinatorics on Partial Words
10.00 - 10.25
Francine Blanchet-Sadri, Sarah Nelson and Amelia Tebbe : On Operations Preserving Primitivity of Partial Words
 
 
10.25 - 10.55
Break
 
 
Session chair: Kanduru Venkata Krishna

10.55 - 11.20
Yoshiyuki Kunimochi : Algebraic Properties of Petri Net Morphisms based on Place Connectivity
11.20 - 11.45
Attila Egri-Nagy, James D. Mitchell and Chrystopher L. Nehaniv : Algorithms for the Efficient Calculation of the Holonomy Decomposition
11.45 – 12.10
Esther-Anna Loeliger and Chrystopher L. Nehaniv : Affordance Graphs for User-Interface Design: Application of Category-theoretic Constructs
12.10 – 12.15
Closing
 
 
12.15
Lunch