posted by user: grupocole || 2683 views || tracked by 2 users: [display]

DCFS 2020 : 22nd International Conference on Descriptional Complexity of Formal Systems

FacebookTwitterLinkedInGoogle


Conference Series : Descriptional Complexity of Formal Systems
 
Link: http://www.informatik.uni-giessen.de/dcfs/dcfs2020.html
 
When N/A
Where paper publication in Springer LNCS
Submission Deadline Jun 15, 2020
Notification Due Jul 31, 2020
Final Version Due Aug 15, 2020
Categories    theoretical computer science
 

Call For Papers

DCFS 2020 collected papers - Call for Papers

Descriptional Complexity of Formal Systems 2020


The 22nd International Conference on Descriptional Complexity of Formal
Systems (DCFS 2020) was expected to be organized by Rudolf Freund at the
TU Wien as part of the Summer of Formal Languages 2020 in Wien, Austria,
and by the IFIP Working Group 1.02 "Descriptional Complexity”.
Unfortunately, due to development of the crisis caused by the Corona virus,
the conference had to be canceled as an event with the participants meeting
in person in Wien. However, in order to allow researchers in the area of
descriptional complexity to still present their recent results in some form,
the DCFS steering committee decided to prepare a volume, collecting papers
which will be selected by a committee after a standard review process
(http://www.informatik.uni-giessen.de/dcfs/dcfs2020.html).
The volume will be published in the series Lecture Notes in Computer Science.
The Steering Committee is also considering the possibility of offering to
the authors of accepted papers the option of giving a short presentation
during DCFS 2021.


IMPORTANT DATES

• Paper submission deadline: June 15, 2020
• Author notification: July 31, 2020
• Final version: August 15, 2020

TOPICS

Submissions concerning the descriptional complexity of formal systems
and structures (and its applications) are invited for DCFS 2020
collected papers. Original papers are sought in all aspects of descriptional
complexity, topics include, but are not limited to:

• Automata, grammars, languages and other formal systems; various
modes of operations and complexity measures.
• Succinctness of description of objects, state-explosion-like phenomena.
• Circuit complexity of Boolean functions and related measures.
• Size complexity of formal systems.
• Structural complexity of formal systems.
• Trade-offs between computational models and mode of operation.
• Applications of formal systems -- for instance in software and
hardware testing, in dialogue systems, in systems modeling or in
modeling natural languages -- and their complexity constraints.
• Co-operating formal systems.
• Size or structural complexity of formal systems for modeling
natural languages.
• Complexity aspects related to the combinatorics of words.
• Descriptional complexity in resource-bounded or structure-bounded
environments.
• Structural complexity as related to descriptional complexity.
• Frontiers between decidability and undecidability.
• Universality and reversibility.
• Nature-motivated (bio-inspired) architectures and unconventional
models of computing.
• Blum Static (Kolmogorov/Chaitin) complexity, algorithmic information.


SELECTION COMMITTEE

• Cezar Câmpeanu, University of Prince Edward Island, Canada
• Pawel Gawrychowski, University of Wrocław, Poland
• Dora Giammarresi, Università di Roma, Italy
• Galina Jirásková, Slovak Academy of Sciences, Košice, Slovakia, co-chair
• Martin Kutrib, University of Giessen, Germany
• Florin Manea, University of Göttingen, Germany
• František Mráz, Charles University in Prague, Czech Republic
• Dana Pardubská, Comenius University, Bratislava, Slovak Republic
• Andrei Păun, University of Bucharest, Romania
• Giovanni Pighizzini, University of Milan, Italy, co-chair
• Rogério Reis, Universidade do Porto, Portugal
• Michel Rigo, University of Liege, Belgium
• Marinella Sciortino, University of Palermo, Italy
• Shinnosuke Seki, The University of Electro-Communications, Chofu, Japan
• Klaus Sutner, Carnegie Mellon University, USA
• Bianca Truthe, University of Giessen, Germany
• György Vaszil, University of Debrecen, Hungary


PAPER SUBMISSION

Authors are invited to submit papers of no more than 12 pages in LNCS
style, and including bibliography in BibTeX using bibliography style
splncs04.bst. Proofs omitted due to space constraints may be put into
an appendix to be read by the reviewers at their discretion. Moreover,
to make the work of reviewers easier, relevant papers needed for a
better understanding of the submitted paper should be appended at the
end, too. Simultaneous submissions to other conferences or workshops
with published proceedings and submitting previously published papers
are not allowed. Papers should be submitted electronically as a PDF
document via EasyChair at the following link:

https://www.easychair.org/conferences/?conf=dcfs2020.

We are looking forward to receiving your submissions!

Galina Jirásková and Giovanni Pighizzini
(Co-chairs of the Selection Committee)

Related Resources

DCFS 2024   Descriptional Complexity of Formal Systems
IJRAP 2024   International Journal of Recent advances in Physics
SIMULTECH 2024   14th International Conference on Simulation and Modeling Methodologies, Technologies and Applications
LearnAut 2024   Learning and Automata
FM 2024   Formal Methods
PCDS 2024   The 1st International Symposium on Parallel Computing and Distributed Systems
ASPLOS 2025   The ACM International Conference on Architectural Support for Programming Languages and Operating Systems
FOCS 2024   Foundations of Computer Science
ICFEM 2024   International Conference on Formal Engineering Methods
DDECS 2024   27th International Symposium on Design and Diagnostics of Electronic Circuits and Systems