27th International Conference on Descriptional Complexity of Formal Systems (DCFS 2025)

Topics

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