CFP: TTATT 2013 - 2nd International Workshop on Trends in Tree Automata and Tree Transducers

[Nobutaka SUZUKI <nsuzuki [at] slis.tsukuba.ac.jp>]

日本データベース学会の皆様

筑波大学の鈴木と申します．

木オートマトン・木変換器に関するワークショップTTATT2013のご案内をさせ
ていただきます．
投稿締切は7月1日となっております．ご投稿をご検討いただければ幸いです． 

どうぞよろしくお願いいたします．
---
鈴木 伸崇 <nsuzuki [at] slis.tsukuba.ac.jp>
筑波大学 図書館情報メディア系
http://nslab.slis.tsukuba.ac.jp/~nsuzuki/


--------------------------------------------------------------------------
                           CALL FOR PAPERS

2nd International Workshop on Trends in Tree Automata and Tree Transducers
                              TTATT 2013
                   October 19, 2013, Hanoi, Vietnam
            http://www.cse.unsw.edu.au/~smaneth/ttatt2013/

co-located with ATVA 2013, October 15 - 18, 2013 
(http://www.uet.vnu.edu.vn/atva2013/)

Tree Automata and Transducers have a long history within computer
science of more than 40 years. Over the last decade, automata theory
has experience a huge revival. This is due to its connections to other
areas such as bioinformatics, computer networks, databases,
linguistics, and verification. A particular demand lies in automata
for tree structured data. For this reason the TTATT workshop was
initiated in 2012 and its first edition was held in Nagoya (Japan) in
conjunction with RTA 2012. This is the second edition of the
workshop. As opposed to the first workshop, we plan for this second
edition to have official proceedings to appear in EPTCS. 

Topics and Goals

Recently, tree automata and transducers have been combined and applied
to various areas in computer science, including rewrite systems,
static analysis of software, program transformation, XML document
processing, and computational linguistics. This workshop aims to
provide an opportunity for researchers from different areas to
exchange ideas on the theory and practice of tree automata and tree
transducers. The topics of the workshop include, but are not limited
to: 

- advanced theory of tree automata and tree transducers
- extensions of tree automata and tree transducers (higher-order/
 weighted/infinite models) 
- relations to TRS, regularity preservation
- application to static analysis and model checking
- application to program transformation
- application to XML document processing 

Important Dates

Submission:	July 1
Notification:	August 1
Final version:	August 16

Submission

Extended abstracts of at most 6 pages are solicited. The work may be
in a preliminary stage, or may be a short version of recently
published articles or papers submitted elsewhere. Accepted papers will
be made available electronically before the workshop. In addition, we
plan to distribute a printed version of the proceedings at the
workshop. 

Original papers will be considered for inclusion in a volume to appear
in EPTCS. Authors of such papers will have additional time of one
month after the workshop to submit an updated version of their paper
to be included in EPTCS. 

Papers should be formatted according to EasyChair style and will be
submitted electronically via an EasyChair submission page. 

Program Committee

Frank Drewes (Umeå University)
Emmanuel Filiot (University of Paris 12)
Andreas Maletti (Universität Stuttgart)
Sebastian Maneth (Chair, University of Oxford)
Akimasa Morihata (Tohoku University)
Keisuke Nakano (The University of Electro-Communications)
Frank Neven (Hasselt University)
Joachim Niehren (INRIA Lille)
Damian Niwinski (Warsaw University)
Luke Ong (University of Oxford)
Helmut Seidl (Technische Universität München)
Hiroyuki Seki (Nagoya University)