Final Call for Papers -- DCFS 2016
We apologize if you receive multiple copies of this Call for Papers.
Please distribute to anyone who may be interested.
====================================================================
Dear colleagues and Friends,
Enclosed you can find the preliminary
C A L L F O R P A P E R S
for
DCFS 2016, Descriptional Complexity of Formal Systems Working
Conference.
--------------------
The 18th International Conference on Descriptional Complexity of Formal
Systems
will take place in Bucharest, Romania, from July 5-8, 2016.
Bucharest is the capital and largest city, as well as the cultural,
industrial, and financial centre of Romania.
The conference is organized by the Faculty of Mathematics and Computer
Science
University of Bucharest, located in the center of Bucharest, at KM 0.
-------------------
The workshop will be jointly organized by The University of Bucharest,
with the support of IFIP Working Group 1.2.
Conference website:
http://www.csit.upei.ca/dcfs2016
and (alternate)
http://fmi.unibuc.ro/dcfs2016
Special thanks go to the invited speakers:
Marie-Pierre Béal (Paris, France)
James Currie (University of Winnipeg, Winnipeg/Manitoba, Canada)
Gabriel Istrate (Timișoara, Romania)
Galina Jirásková (Mathematical Institute Slovak Academy of Sciences,
Kosice, Slovak Republic)
Solomon Marcus (Romanian Academy, Bucharest, Romania)
for accepting our invitation to present their recent results at DCFS 2016.
Important Dates:
Submission Deadline: March 1 extended to March 4 AoE, 2016 (possible
updates of existing submissions March 6 AoE)
Notification of accepted papers: April 7, 2016(updated)
Final Version: April 15, 2016(updated)
Conference dates: July 5-8, 2016
Topics of interest:
Submissions concerning the descriptional complexity of formal systems
and structures (and its applications) are invited for DCFS
2016. Original papers are sought in all aspects of descriptional complexity,
topics include, but are not limited to:
- various modes of operations and complexity measures for automata,
grammars, languages and of related systems
- succinctness of description of objects, state-explosion-like phenomena
- trade-offs between descriptional complexity and mode of operation
- circuit complexity of Boolean functions and related measures
- succinctness of description of (finite) objects
- descriptional complexity in resource-bounded or structure-bounded
environments
- complexity aspects related to the combinatorics of words
- structural complexity of formal systems as related to descriptional
complexity
- descriptional complexity of formal systems for applications (e.g.
software reliability, software
and hardware testing, modelling of natural languages)
- descriptional complexity aspects of nature-motivated (bio-inspired)
architectures and unconventional models of computing
- frontiers between decidability and undecidability
- universality and reversibility
- Blum Static (Kolmogorov/Chaitin) complexity, algorithmic information
Submissions:
Papers presenting original contributions concerning the topics of the
conference are being
sought. Authors are invited to submit papers of no more than 12 pages
in LNCS-style LaTeX2e (available at
http://www.springer.de/comp/lncs/authors.html). Papers must be in
English, and provide sufficient details to allow the program committee
to assess their merits. Proofs omitted due to space constraints must
be added into an appendix to be read by the program committee members at
their discretion. Simultaneous submission to other conferences or
workshops with published proceedings is _*not*_ allowed.
Papers will be submitted electronically in PDF, using the EasyChair system.
Program Commitee:
Valérie Berthé (Paris, France)
Cezar Câmpeanu (Charlottetown/PE, Canada, co-chair)
Cristian S. Calude (Auckland, New Zealand)
Zoltan Esik (Szeged, Hungary)
Yo-Sub Han (Seoul, Republic of Korea)
Christos Kapoutsis (Doha, Qatar)
Lila Kari (Waterloo/Ontario, Canada)
Jarkko J Kari (Turku, Finland)
Stavros Konstantinidis (St Mary's University, Halifax/Nova Scotia,
Canada)
Martin Kutrib (Gießen, Germany)
Florin Manea (Kiel, Germany, co-chair)
Ian McQuillan (Saskatoon/Saskatchewan, Canada)
Carlo Mereghetti (Milano, Italy)
Nelma Moreira (Porto, Portugal)
Dirk Nowotka (Kiel, Germany)
Alexander Okhotin (Turku, Finland)
Dana Pardubska (Bratislava, Slovak Republic)
Andrei Paun (University of Bucharest, Bucharest, Romania)
Giovanni Pighizzini (Milano, Italy)
Jean-Eric Pin (Paris, France)
Marinella Sciortino (Palermo, Italy)
Jeffrey O. Shallit (Waterloo/Ontario, Canada, co-chair)
Bianca Truthe (Gießen, Germany)
Steering Committee:
Cezar Câmpeanu (University of Prince Edward Island,
Charlottetown/Prince Edward Island, Canada)
Erzsébet Csuhaj-Varjú (Budapest, Hungary)
Jürgen Dassow (Otto-von-Guericke-University of Magdeburg, Magdeburg,
Germany)
Helmut Jürgensen (Western University, London/Ontario, Canada)
Martin Kutrib (Giessen University, Giessen, Germany)
Giovanni Pighizzini (University of Milano, Milano, Italy, chair)
Rogério Reis (University of Porto, Porto, Portugal)
Organizing Committee:
Radu Gramatovici (University of Bucharest)
~ (Full list will be announced at a later date)
CONTACT:
Postal address:
DCFS 2016 Organizing Committee,
Department of Computer Science University of Bucharest,
Str.Academiei nr. 14, Bucharest, Romania
Email: dcfs2016@fmi.unibuc.ro
======================================================
We hope that many of you will submit papers and will attend the Conference.
With best regards,
Cezar Câmpeanu (University of Prince Edward Island)
Florin Manea (University of Kiel)
Jeffrey Shallit (University of Waterloo)
k
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
