posted by user: grupocole || 1899 views || tracked by 6 users: [display]

DCFS 2014 : 16th International Workshop on Descriptional Complexity of Formal Systems


Conference Series : Descriptional Complexity of Formal Systems
When Aug 5, 2014 - Aug 8, 2014
Where Turku, Finland
Submission Deadline Apr 11, 2014
Notification Due May 9, 2014
Final Version Due May 23, 2014
Categories    theoretical computer science   NLP

Call For Papers

Call for Papers -- DCFS 2014

16th International Workshop on Descriptional Complexity of Formal Systems

Turku, Finland

August 5--8, 2014

DCFS 2014 will be held in Turku, Finland, on August 5--8, 2014. It will be
preceded by NCMA 2014 in Kassel, Germany (July 28--29) and CIAA 2014 in
Giessen, Germany (July 30--August 2).

The workshop is organized by the research centre on Fundamentals of Computing
and Discrete Mathematics (FUNDIM) at the Department of Mathematics and
Statistics, University of Turku.

Invited Speakers

Andris Ambainis (University of Latvia, Latvia)
Oscar H. Ibarra (University of California at Santa Barbara, USA)
Manfred Kufleitner (University of Stuttgart, Germany)
Nikolay Vereshchagin (Moscow State University, Russia)

Important Dates

Submission deadline: April 11, 2014
Notification: May 9, 2014
Final version: May 23, 2014
Conference dates: August 5--8, 2014

Topics of interest

Submissions concerning the descriptional complexity of formal systems
and structures (and its applications) are invited for DCFS 2014. Topics
related to all aspects of descriptional complexity, including, but not
limited to:

- automata, grammars, languages and other formal systems, various modes
of operation and complexity measures,

- trade-offs between computational models and modes of operation,

- succinctness of description of objects, state explosion-like phenomena,

- circuit complexity of Boolean functions and related measures,

- resource-bounded or structure-bounded environments,

- frontiers between decidability and undecidability,

- universality and reversibility,

- structural complexity,

- formal systems for applications (e.g., software reliability, software
and hardware testing, modelling of natural languages),

- nature-motivated (bio-inspired) architectures and unconventional
models of computing,

- complexity aspects of combinatorics on words,

- Kolmogorov complexity.


Submissions concerning the descriptional complexity of formal systems
are invited for the workshop. Papers on applications of such issues,
for instance in the fields of software or hardware testing, systems
modelling, natural language modelling as well as demonstrations of
systems related to these issues are also welcome.

The papers should present original research contributions concerning
the topics of the workshop. They should not exceed 12 pages when
prepared using LaTeX and the style of the Springer Lecture Notes in
Computer Science. The style-file is available from Springer by the
following link:

Papers must be written in English and must provide sufficient detail for
the program committee to assess their merits. If the authors believe that
more details are essential to substantiate the main claims, they may
include a clearly marked appendix that will be read at the discretion of
the program committee. Simultaneous submission to journals or to other
conferences with published proceedings is not allowed.

Papers should be submitted as pdf files electronically using the EasyChair system:

The proceedings will be published in the Springer Lecture Notes in
Computer Science (LNCS) series and will be available at the workshop.
Accepted papers must be presented at the workshop. As in the previous
years, a special journal issue with full versions of selected papers
will be devoted to DCFS 2014.

Discussion/open problems session

The organizers are prepared to reserve some time for "discussion papers"
reporting on open problems, work in progress, etc. Speakers are invited
to express their interest to the organizing committee by the end of May.
If there is a sufficient interest in the community, a local proceedings
volume dedicated to the discussion session may be published. The details
will be announced later.

Programme Committee

Cristian Calude (University of Auckland, New Zealand)
Frank Drewes (Umea University, Sweden)
Viliam Geffert (P. J. Safarik University, Kosice, Slovakia)
Helmut Jurgensen (University of Western Ontario, Canada, co-chairman)
Christos Kapoutsis (Carnegie Mellon University, Qatar)
Juhani Karhumaki (University of Turku, Finland, co-chairman)
Michal Kunc (Masaryk University, Brno, Czech Republic)
Martin Kutrib (University of Giessen, Germany)
Christof Loding (RWTH Aachen, Germany)
Pierre McKenzie (University of Montreal, Canada; ENS Cachan, France)
Alexander Okhotin (University of Turku, Finland, co-chairman)
Giovanni Pighizzini (Universita degli Studi di Milano, Italy)
Kai Salomaa (Queen's University, Canada)
Klaus Sutner (Carnegie Mellon University, USA)
Damien Woods (California Institute of Technology, USA)

Steering Committee

Erzsebet Csuhaj-Varju (Budapest, Hungary)
Jurgen Dassow (Magdeburg, Germany)
Helmut Jurgensen (London, Canada)
Martin Kutrib (Giessen, Germany)
Giovanni Pighizzini (Milano, Italy, chair)
Detlef Wotschke (Frankfurt, Germany)


Web page:
E-mail: dcfs2014 AT utu DOT fi

Related Resources

DCFS 2017   19th International Conference on Descriptional Complexity of Formal Systems
EMNLP 2017   Conference on Empirical Methods in Natural Language Processing
SIMULTECH 2017   7th International Conference on Simulation and Modeling Methodologies, Technologies and Applications
EMNLP 2017   Empirical Methods in Natural Language Processing
ICFEM 2017   19th International Conference on Formal Engineering Methods
TSD 2017   20th International Conference on Text, Speech and Dialogue
IPMU 2018   17th Information Processing and Management of Uncertainty in Knowledge-Based Systems Conference
LTA 2017   2nd International Workshop on Language Technologies and Applications
AACSN 2017   Complexity Special Issue on Analysis and Applications of Complex Social Networks
STOC 2017   Symposium on the Theory of Computing