Submissions concerning the descriptional complexity of formal systems<br>and structures (and its applications) are invited for DCFS<br>2017. Original papers are sought in all aspects of descriptional complexity,<br>topics include, but are not limited to:<br>– Automata, grammars, languages and other formal systems; various modes<br>of operations and complexity measures.<br>– Succinctness of description of objects, state–explosion–like phenomena.<br>– Circuit complexity of Boolean functions and related measures.<br>– Size complexity of formal systems.<br>– Structural complexity of formal systems.<br>– Trade–offs between computational models and mode of operation.<br>– Applications of formal systems –– for instance in software and<br>hardware testing, in dialogue systems,<br>in systems modeling or in modeling natural languages–– and their complexity<br>constraints.<br>– Co–operating formal systems.<br>– Size or structural complexity of formal systems for modeling<br>natural languages.<br>– Complexity aspects related to the combinatorics of words.<br>– Descriptional complexity in resource–bounded or structure–bounded<br>environments.<br>– Structural complexity as related to descriptional complexity.<br>– Frontiers between decidability and undecidability.<br>– Universality and reversibility.<br>– Nature–motivated (bio–inspired) architectures and unconventional models<br>of computing.<br>– Blum Static (Kolmogorov/Chaitin) complexity, algorithmic information.<br>
Abbrevation
DCFS
City
Milano
Country
Italy
Deadline Paper
Start Date
End Date
Abstract