Abbrevation
DCFS
City
Milano
Country
Italy
Deadline Paper
Start Date
End Date
Abstract

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