Conf: CIAA 2012, Porto, Portugal, July 17-20, 2012
Thierry Hamon
thierry.hamon at UNIV-PARIS13.FR
Wed May 2 10:32:45 UTC 2012
Date: Mon, 30 Apr 2012 09:33:24 +0200 (CEST)
From: Denis Maurel <denis.maurel at univ-tours.fr>
Message-ID: <2020797742.9738.1335771204061.JavaMail.root at mail10>
X-url: http://www.dcc.fc.up.pt/CIAA12
Apologies for multiple copies
-----------------------------
17th International Conference on Implementation and Application of
Automata
Porto, Portugal
July 17-20, 2012
http://www.dcc.fc.up.pt/CIAA12
-------------------
CALL FOR PARTICIPATION and DEMO SESSION CIAA12
Early registration deadline: June 1, 2012
Deadline for system demos: June 1, 2012
CIAA is the premier annual conference for researchers, application
developers and users of automata-based systems. The applications of the
theory of automata, a foundational area of computer science, have spread
to almost all areas of computer science and many other disciplines.
CIAA 2012 will be held just before DCFS 2012 which will take place in
Braga, also in Portugal and less then 50 km from Porto, on July 23--25.
REGISTRATION
------------
On-line registration:
http://www.dcc.fc.up.pt/CIAA12/Registration
If you plan to attend both CIAA and DCFS, please consider to choose the
Combo CIAA+DCFS fee. The fees are the following:
Registration until June 1:
Regular CIAA 300,00 EUR
Student CIAA 260,00 EUR
Combo CIAA+DCFS 480,00 EUR
Registration from June 2 on:
Regular CIAA 350,00 EUR
Student CIAA 290,00 EUR
Combo CIAA+DCFS 565,00 EUR
Accompanying person CIAA: 70,00 EUR
The conference registration (regular and student) fee includes:
* Admission to all scientific sessions
* Conference materials (proceedings, program, etc.)
* Coffee breaks and lunches
* Welcome reception
* Excursion with conference dinner
Accompanying guest fee includes:
* Welcome reception
* Excursion with conference dinner
CALL FOR DEMO SESSION
---------------------
We encourage the submission of software demos related to all topics of
the conference. Developers wishing to demonstrate their software should
submit a two-pages description to the outlining the design of their
system and its application area(s). Submissions should use the
LNCS-style LaTeX2e, and be send (latex+pdf) to: ciaa12 at dcc.fc.up.pt
The descriptions of accepted demos will appear in a booklet available at
the conference.
DEADLINE for system demo submissions is June 1.
INVITED SPEAKERS
----------------
Janusz Brzozowski (U. of Waterloo, Canada), "In Search of Most Complex
Regular Languages"
Paul Gastin (ENS de Cachan, Fance), "Adding Pebbles to Weighted
Automata"
José Nuno Oliveira (U. do Minho, Portugal) "Typed linear algebra for
probabilistic automata"
Grzegorz Rozenberg (Leiden, The Netherlands), "A Formal Framework for
Processes Inspired by the Functioning of Living Cells "
Kai Salomaa (Queen's U., Kingston, Canada), "In Memoriam of Sheng Yu"
VENUE
-----
CIAA 2012 will take place in Porto, the second largest city in Portugal,
located by the Douro river and the Atlantic Ocean. Porto dates back to
the IV century and the city center is classified as world heritage
patrimony by UNESCO. The city is also known worldwide for the renowned
Port Wine.
The venue will be the Faculty of Sciences of the University of Porto
located in Campo Alegre area and very close to the conference hotels.
ACCOMODATION
------------
The Organizing Committee of CIAA 2012 pre-booked some rooms in various
hotels of different categories close to the meeting venue. See:
http://www.dcc.fc.up.pt/CIAA12/Accomodation/
ACCEPTED PAPERS
---------------
Full Papers
1 "A Disambiguation Algorithm for Finite Automata and Functional
Transducers", Mehryar Mohri
2 "A Fast Suffix Automata Based Algorithm for Exact Online String
Matching", Simone Faro and Thierry Lecroq
3 "A Pushdown Transducer Extension for the OpenFst Library", Cyril
Allauzen and Michael Riley
4 "Automatic Theorem-Proving in Combinatorics on Words", Dane Henshall
and Jeffrey Shallit
5 "Cellular automata on regular rooted trees", Tullio
Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi and
Zoran Sunic
6 "Crossing the Syntactic Barrier: Hom-Disequalities for H1-Clauses",
Andreas Reuss and Helmut Seidl
7 "How to Synchronize the Heads of a Multitape Automaton", Oscar Ibarra
and Nicholas Tran
8 "Hyper-Minimization for Deterministic Tree Automata", Artur Jeż and
Andreas Maletti
9 "Implementing computations in automaton (semi)groups", Ines Klimann,
Jean Mairesse and Matthieu Picantin
10 "Nominal automata for resource usage control", Pierpaolo Degano,
Gianluigi Ferrari and Gianluca Mezzetti
11 "On the Descriptional Complexity of the Window Size for Deterministic
Restarting Automata", Martin Kutrib and Friedrich Otto
12 "On the State and Computational Complexity of the Reverse of Acyclic
Minimal DFAs", Galina Jiraskova and Tomas Masopust
13 "P(l)aying for Synchronization", Fedor Fominykh and Mikhail Volkov
14 "Regular Ideal Languages and their Boolean Combinations", Franz Jahn,
Manfred Kufleitner and Alexander Lauser
15 "Restarting Tiling Automata", Daniel Prusa and Frantisek Mraz
16 "Strict local testability with consensus equals regularity", Stefano
Crespi Reghizzi and Pierluigi San Pietro
17 "Synchronization of automata with one undefined or ambiguous
transition", Martyugin Pavel
18 "Synchronizing Automata on Quasi Eulerian Digraph", Mikhail Berlinkov
19 "Synchronizing automata of bounded rank", Vladimir Gusev
20 "Weak Inclusion for recursive XML Types", Joshua Amavi, Jacques
Chabin and Pierre Rety
21 "Weighted Nested Word Automata and Logics over Strong Bimonoids",
Manfred Droste and Bundit Pibaljommee
Short Papers
1 "Automata with Modulo Counters and Nondeterministic Counter Bounds",
Daniel Reidenbach and Markus L. Schmid
2 "Factor and Subsequence Kernels of Rational Languages", Ahmed Amarni
and Sylvain Lombardy
3 "Multi-Tilde-Bar Expressions and their Derivatives", Pascal Caron,
Jean-Marc Champarnaud and Ludovic Mignot
4 "On Positive TAGED with a Bounded Number of Constraints",
Pierre-Cyrille Heam, Vincent Hugot and Olga Kouchnarenko
5 "On the weighted closure problem", Sylvain Lombardy and Jacques
Sakarovitch
6 "SDFA: Series DFA for Memory-Efficient Regular Expression Matching",
Tingwen Liu, Yong Sun, Li Guo and Binxing Fang
7 "Weighted LTL with Discounting", Eleni Mandrali
PROGRAM COMMITTEE
Marie-Pierre Beal - France
Béatrice Bouchou-Markhoff - France
Patricia Bouyer - France
Cezar Campeanu - Canada
Pascal Caron - France
Jean-Marc Champarnaud - France
Jan Daciuk - Poland
Michael Domaratzki - Canada
Yo-Sub Han - South Korea
Tero Harju - Finland
Markus Holzer - Germany
Oscar Ibarra - USA
Masami Ito - Japan
Joost-Pieter Katoen - Germany
Stavros Konstantinidis - Canada
Andreas Maletti - Germany
Sebastian Maneth - Australia
Denis Maurel - France
Ian McQuillan - Canada
Mehryar Mohri - USA
Nelma Moreira - Portugal (co-chair)
Alexander Okhotin - Finland
Giovanni Pighizzini - Italy
Bala Ravikumar - USA
Rogério Reis - Portugal (co-chair)
Kai Salomaa - Canada
Colin Stirling - United Kingdom
Mikhail Volkov - Russian Federation
Bruce Watson - South Africa
Hsu-Chun Yen - Taiwan
Sheng Yu - Canada
STEERING COMMITTEE
Jean-Marc Champarnaud - France
Markus Holzer - Germany
Oscar Ibarra - USA
Denis Maurel - France
Kai T. Salomaa - Canada (Chair)
Hsu-Chun Yen - Taiwan
ORGANIZING COMMITTEE
Sabine Broda (U. Porto)
António Machiavelo (U. Porto)
Nelma Moreira (U. Porto)
Rogério Reis (U. Porto)
Simão Sousa (U. Beira Interior)
The conference has the scientific sponsorship of University of Porto,
University of Beira Interior, CMUP, LIACC, and EATCS.
For a small poster to download and display:
http://www.dcc.fc.up.pt/CIAA12/resources/CIAA2012a3.pdf
CONTACT
Postal address:
CIAA 2012
DCC-FCUP
Rua do Campo Alegre, 1021-1055
4169-007 Porto,
Portugal
Email: ciaa12 at dcc.fc.up.pt
-------------------------------------------------------------------------
Message diffuse par la liste Langage Naturel <LN at cines.fr>
Informations, abonnement : http://www.atala.org/article.php3?id_article=48
English version :
Archives : http://listserv.linguistlist.org/archives/ln.html
http://liste.cines.fr/info/ln
La liste LN est parrainee par l'ATALA (Association pour le Traitement
Automatique des Langues)
Information et adhesion : http://www.atala.org/
-------------------------------------------------------------------------
More information about the Ln
mailing list