[Proof Complexity] 2nd CFP: DCFS 2024 (Santa Clara, June 25-27, deadlines updated)

Nelma Moreira nelma.moreira at fc.up.pt
Tue Mar 26 20:13:00 CET 2024

         		  CALL FOR PAPERS
                              DCFS 2024
International Conference on Descriptional Complexity of Formal Systems
                        Santa Clara University
                          June 25 - 27, 2024

                          dcfs2024 at gmail.com

               Paper submission deadline: April 12, 2024
                  Author notification: April 26, 2024
                Camera-ready deadline: May 10, 2024

The 26th edition of DCFS is organized by the Department of Mathematics and Computer Science of Santa Clara University, USA and by the IFIP Working Group 1.02 "Descriptional Complexity".


Original research papers concerning the descriptional complexity of formal systems and structures (and its applications) are sought. 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.


    1. Michaël Cadilhac (DePaul University, USA)

    2. Ian McQuillan (University of Saskatchewan, Canada)

    3. Bala Ravikumar (Sonoma State University, USA)


    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)


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


After logging in to your EasyChair account, select the "New Submission" menu item on the top of the page.  If you do not have an EasyChair account, follow the instructions on the login page. 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.

More information about the Proof-Complexity mailing list