DCFS 2027
28th International Conference on Descriptional Complexity of Formal Systems
Organised by the IFIP Working Group 1.02 “Descriptional Complexity” and hosted by the Faculty of Information Technology, Brno University of Technology — co-located with NCMA 2027.
- Dates
- 30 August – 2 September 2027
- Venue
- FIT BUT, Brno
- Series
- IFIP WG 1.02
- Proceedings
- Springer
About
Studying the cost of description
The DCFS conference series is an international venue for presenting new results in descriptional complexity — the branch of computer science that studies how economically objects can be described within different computational models, such as Turing machines, pushdown automata, finite automata and grammars.
DCFS 2027 continues the series most recently held in Kingston, Canada, bringing the conference to Brno for its 28th edition. See the full DCFS conference series history.
Co-located with
NCMA 2027
DCFS 2027 will be co-located with the 17th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2027), held back-to-back on the same campus.
Read about NCMA 2027Scope
Principal topics
DCFS focuses on the descriptional complexity of formal systems and structures and their applications, including but not limited to:
- Automata, grammars, languages and other formal systems; modes of operation 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 modes of operation
- Applications of formal systems — e.g. software and hardware testing, dialogue systems, systems modelling and natural-language modelling — and their complexity constraints
- Co-operating formal systems
- Size or structural complexity of formal systems for modelling 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
- Static (Kolmogorov/Chaitin) complexity and algorithmic information
Publication
Proceedings
As in previous editions, the proceedings are expected to be published by Springer.
A special issue of Theoretical Computer Science (TCS) containing selected accepted papers is planned.
Take part
Submitting a paper
Formatting guidelines, page limits and the submission link for DCFS 2027 are published on the Call for Papers page once the submission system opens.
Submit a paperKey dates for DCFS 2027
Submission, notification and registration deadlines.