Conf: CIAA 2007 (early reg. June 17, 2007)

Thierry Hamon thierry.hamon at LIPN.UNIV-PARIS13.FR
Tue Jun 5 14:45:23 UTC 2007

Date: Sun, 3 Jun 2007 14:30:11 +0200 (MEST)
From: holub at

We apologize if you have received multiple copies of this announcement.
                        CALL FOR PARTICIPATION

                              CIAA 2007
12th International Conference on Implementation and Application of Automata
               July 16-18, 2007, Prague, Czech Republic

The 12th edition of the CIAA will take place in Prague, Czech
Republic, on July 16-18, 2007. The conference will be hosted by the
Department of Computer Science and Engineering, Faculty of Electrical
Engineering, Czech Technical University in Prague.

We have a strong scientific program that includes paper presentations,
posters, as well as four invited lectures:


  * Gheorghe Paun (Romanian Academy, Romania)
    "Spiking neural P systems used as acceptors and transducers"

  * Moshe Vardi (Rice University, USA)
    "Linear-Time Model Checking: Automata Theory in Practice"

  * Bruce W. Watson (University of Pretoria, South Africa; Sagantec, USA)
    "Automata applications in chip-design software"

  * Michael Riley (Google, Inc., USA)
    "OpenFst: a General and Efficient Weighted Finite-State Transducer 


  * Mikhail Volkov.
    Synchronizing automata preserving a chain of partial orders

  * Margareta Ackerman and Jeffrey Shallit.
    Efficient Enumeration of Regular Languages

  * Massimiliano Goldwurm and Roberto Radicioni.
    Average value and variance of pattern statistics in rational

  * Joni Pirnot and Natasha Jonoska.
    Finite State Automata Representing Two-Dimensional Dubshifts

  * Shmuel Tomi Klein and Miri Kopel Ben-Nissan.
    Accelerating Boyer Moore Searches on Binary Texts

  * Maxime Crochemore, Chiara Epifanio, Alessandra Gabriele and
    Filippo Mignosi.

    On the Suffix Automaton with mismatches

  * Michael Holtmann and Christof Löding.
    Memory Reduction for Strategies in Infinite Games

  * George Rahonis and Manfred Droste.
    Weighted automata and weighted logics with discounting

  * Frantisek Mraz, Martin Platek and Friedrich Otto.
    A Natural Measure for The Degree of Nondeterminism of Context-free

  * Kai Salomaa, Sheng Yu and Jinfeng Zan.
    Deterministic Caterpillar Expressions

  * Martin Kutrib and Andreas Malcher.
    Regulated Nondeterminism in Pushdown Automata

  * Didier Caucal, Jurek Czyzowicz, Wojciech Fraczak and Wojciech
    Efficient Computation of Throughput Values of Context-Free

  * Claus Brabrand, Robert Giegerich and Anders Møller.
    Analyzing Ambiguity of Context-Free Grammars

  * Magnus Steinby and Catalin Ionut Tirnauca.
    Syntax-Directed Translations and Quasi-Alphabetic Tree Bimorphisms

  * Marcella Anselmo, dora giammarresi and maria Madonia.
    Tiling Automaton: a Computational Model for Recognizable
    Two-dimensional Languages

  * Johanna Högberg, Andreas Maletti and Jonathan May.
    Backward and Forward Bisimulation Minimisation of Tree Automata

  * Jean-Marc Champarnaud, Franck Guingne and Jacques Farré.
    Reducing acyclic cover transducers

  * Joachim Klein and Christel Baier.
    On-the-fly Stuttering in the Construction of Deterministic

  * Mehryar Mohri, Pedro Moreno and Eugene Weinstein.
    Factor Automata of Automata and Applications

  * Gregory Kucherov, Laurent Noé and Mikhail Roytberg.
    Subset seed automaton

  * Hannu Peltola and Jorma Tarhio.
    On String Matching in Chunked Texts

  * Francois Barthelemy.
    Multi-Grain Relations

  * Rafael Carrasco, Jan Daciuk and Mikel Forcada.
    An implementation of deterministic tree automata minimization


  * Michal Voracek, Ladislav Vagner, Costas Iliopoulos and M. Sohel
    The Constrained Longest Common Subsequence Problem for Degenerate

  * Olivier Blanc, Matthieu Constant and Patrick Watrin.
    A Finite-State Super-Chunker

  * Anssi Yli-Jyrä and Kimmo Koskenniemi.
    A New Method for Compiling Parallel Replacement Rules

  * Frédérique Bassino, Julien David and Cyril Nicaud.
    REGAL: a library to randomly and exhausively generate automata

  * Jan Supol.
    Significant Subpatterns Matching

  * B Klunder.
    Finite automata accepting star-connected languages

  * Clemens Marschner.
    Efficiently Matching With Local Grammars Using Prefix Overlay


Registration is open on the web site:

Early registration deadline is approaching: June 17, 2007


Marie-Pierre Beal (Marne-la-Vallee, France)
Cristian Calude (Auckland, New Zealand)
Jean-Marc Champarnaud (Rouen, France)
Erzsebet Csuhaj-Varju (Budapest, Hungary)
Jurgen Dassow (Magdeburg, Germany)
Jacques Farre (Nice, France)
Jozef Gruska (Brno, Czech Republic)
Tero Harju (Turku, Finland)
Jan Holub, Co-Chair (Prague, Czech Republic)
Markus Holzer (Munchen, Germany)
Juraj Hromkovic (Zurich, Switzerland)
Oscar H. Ibarra (Santa Barbara, USA)
Masami Ito (Kyoto, Japan)
Kazuo Iwama (Kyoto, Japan)
Juhani Karhumaki (Turku, Finland)
Werner Kuich (Vienna, Austria)
Denis Maurel (Tours, France)
Giancarlo Mauri (Milano, Italy)
Borivoj Melichar, Co-Chair (Prague, Czech Republic)
Mehryar Mohri (New York, USA)
Gheorghe Paun (Bucharest, Romania)
Giovanni Pighizzini (Milano, Italy)
Jean-Eric Pin (Paris, France)
Bala Ravikumar (Sonoma, USA)
Wojciech Rytter (Warsaw, Poland)
Kai Salomaa (Kingston, Canada)
Pierluigi San Pietro (Milano, Italy)
Bow-Yaw Wang (Taipei, Taiwan)
Bruce Watson (Pretoria, South Africa)
Hsu-Chun Yen (Taipei, Taiwan)
Sheng Yu (London, Canada)


Miroslav Balik, Co-Chair (Prague, Czech Republic)
Jan Holub, Co-Chair (Prague, Czech Republic)
Michal Voracek (Prague, Czech Republic)
Ladislav Vagner (Prague, Czech Republic)
Jan Zdarek (Prague, Czech Republic)

For more information about the CIAA conferences visit

Message diffuse par la liste Langage Naturel <LN at>
Informations, abonnement :
English version       : 
Archives                 :

La liste LN est parrainee par l'ATALA (Association pour le Traitement
Automatique des Langues)
Information et adhesion  :

More information about the Ln mailing list