CIAA is the premier annual forum for researchers, application developers, and users of automata-based systems. Automata theory is the foundation of computer science. Its applications have spread to almost all areas of computer science and many other disciplines. The CIAA conferences concern research on all aspects of implementation and application of automata and related structures, including theoretical aspects. The past conferences have an impressive record of publishing significant papers in the applications of finite automata in
The conference also accepts papers that advance the state of the art in the theoretical study of finite automata, regular expressions, grammars and related formal models. A goal of the conference is to provide additions and enhancements to existing software systems that manipulate automata, regular expressions, grammars, and related structures; examples of such systems include AGL, AMoRE, ASTL, Automate, FADELA, FinITE, FIRE Station, JFLAP, FSM, Grail+, INR, Intex, MERLin, MONA, TESTAS, Turing's World, Vaucanson, WFSC and Whale Calf.
At CIAA 09 we will have special invited talk sessions devoted to the implementation and application of automata in different areas of computer science. There will be three invited talks on Application of Automata:
Submission deadline: March 29
Notification deadline: April 20
Camera-ready version: May 4
The proceedings of CIAA 2009 will be published by Springer
as volume 5642 of the
LNCS series.