[Proof Complexity] DCFS 2024 - call for papers

Nelma Moreira nelma.moreira at fc.up.pt
Tue Nov 28 00:36:02 CET 2023

We apologise for multiple copies.

First Call for Papers

26th International Conference on Descriptional Complexity of Formal Systems 

June  25-27, 2024,  Santa Clara, CA, USA

Deadline for submissions: March 1, 2024 
==================== ==============================

The 26th International Conference on Descriptional Complexity of Formal Systems is organized
by the Department of Mathematics & Computer Science of Santa Clara University
in conjunction with the IFIP Working Group 1.02 "Descriptional Complexity."


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  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.


Deadline for submissions: March 1, 2024
Notification to authors:   April 2, 2024
Final Version :   April 11, 2024               
DCFS 2024: June 25-27, 2024                     


Submissions to DCFS must not exceed 12 pages in Springer-Verlag's Lecture Notes style including bibliography.
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 submissions of papers to any other conference with published proceedings or submitting previously published papers is not allowed.

Papers should be submitted electronically as a PDF document to www.easychair.org/conferences/?conf=dcfs24.

The proceedings will be published by Springer-Verlag in the series Lecture Notes in Computer Science.
In addition, a special issue of Journal of Automata, Languages, and Combinatorics
will be devoted to revised and extended versions of selected papers of the conference.


Henning Bordihn (University of Potsdam, Germany), co-chair
Pascal Caron (University of Rouen, France)
Szilárd Fazekas (Akita University, Japan)
Yo-Sub Han (Yonsei University, Republic of Korea)
Galina Jirásková (Slovak Academy of Sciences, Slovakia)
Stavros Konstantinidis (Saint Mary's University, Canada)
Martin Kutrib (University of Giessen, Germany)
Ian McQuillan (University of Saskatchewan, Canada)
Timothy Ng (University of Chicago, USA)
Alexander Okhotin (St. Petersburg State University, Russia)
Giovanni Pighizzini (University of Milan, Italy)
Chris Pollett (San Jose State University, USA)
Luca Prigioniero (Loughborough University, UK)
Bala Ravikumar (Sonoma State University, USA)
Rogérior Reis (University of Porto, Portugal)
Kai Salomaa (Queen's University, Canada)
Shinnosuke Seki (The University of Electro-Communications, Japan)
Howard Straubing (Boston College, USA)
Nicholas Tran (Santa Clara University, USA), co-chair
György Vaszil (University of Debrecen, Hungary)
Hsu-Chun Yen (National Taiwan University, Taiwan)


Cezar Câmpeanu (Charlottetown, Canada)

Erzsébet Csuhaj-Varjú (Budapest, Hungary)

Stavros Konstantinidis (Halifax, Canada)

Martin Kutrib (Giessen, Germany)

Giovanni Pighizzini (Milano, Italy)

Rogério Reis (Porto, Portugal, chair)

Kai Salomaa (Kingston, Canada)


Thai Nhan (Santa Clara University)

Nicholas Tran (Santa Clara University)


Web: https://sites.google.com/scu.edu/dcfs24

Email: dcfs2024 at gmail.com

More information about the Proof-Complexity mailing list