|
Home
Steering Committee
Past Editions
Proceedings
Special Issues
|
|
Descriptional Complexity of
Formal Systems (DCFS)
Welcome to the Web Pages of DCFS
DCFS is an annual international working conference concerning the descriptional complexity of formal systems and structures (and its applications).
Topics of interest are related to all aspects of descriptional complexity, including, but not limited to
- automata, grammars, languages and related systems, various measures and modes of operations (e.g., determinism and nondeterminism)
- trade-offs between computational models and/or operations
- succinctness of description of (finite) objects
- state explosion-like phenomena
- circuit complexity of Boolean functions and related measures
- resource-bounded or structure-bounded environments
- frontiers between decidability and undecidability
- universality and reversibility
- structural complexity
- formal systems for applications (e.g., software reliability, software and hardware testing, modelling of natural languages)
- nature-motivated (bio-inspired) architectures and unconventional models of computing
- Kolmogorov complexity
DCFS 2024
|