Submissions concerning the descriptional complexity of formal systems and structures (and its applications) are invited for DCFS 2008.
Topics include, but are not limited to:

various measures of descriptional complexity of automata, grammars, languages and of related systems

tradeoffs between descriptional complexity and mode of operation

circuit complexity of Boolean functions and related measures

succinctness of description of (finite) objects

descriptional complexity in resourcebounded or structurebounded environments

structural complexity

descriptional complexity of formal systems for applications (e.g. software reliability, software and hardware testing, modelling of natural languages)
 descriptional complexity aspects of naturemotivated (bioinspired) architectures and unconventional models of computing

Kolmogorov/Chaitin complexity and descriptional complexity
In accordance with the spirit of a workshop, the program committee will try to accept as many papers as possible, provided that their scientific quality is high and merits acceptance. If the number of such papers exceeds the number of time slots for "regular" presentation, the program committee will try to accept some papers as "short" papers.
