BEGIN:VCALENDAR
VERSION:2.0
PRODID:https://github.com/derhansen/sf_event_mgt
METHOD:PUBLISH
BEGIN:VEVENT
UID:1926-3266@fg-afs.gi.de
CLASS: PUBLIC
SUMMARY:19th International Conference on Descriptional Complexity of Formal
  Systems
DESCRIPTION:Submissions concerning the descriptional complexity of formal s
 ystems and structures (and its applications) are invited for DCFS 2017. Ori
 ginal papers are sought in all aspects of descriptional complexity, topics 
 include, but are not limited to:\n\n 	Automata, grammars, languages and oth
 er formal systems; various modes of operations and complexity measures. 	Su
 ccinctness of description of objects, state-explosion-like phenomena. 	Circ
 uit complexity of Boolean functions and related measures. 	Size complexity 
 of formal systems. 	Structural complexity of formal systems. 	Trade-offs be
 tween computational models and mode of operation. 	Applications of formal s
 ystems – for instance in software and hardware testing, in dialogue systems
 , in systems modeling or in modeling natural languages – and their complexi
 ty constraints. 	Co-operating formal systems. 	Size or structural complexit
 y of formal systems for modeling natural languages. 	Complexity aspects rel
 ated to the combinatorics of words. 	Descriptional complexity in resource-b
 ounded or structure-bounded environments. 	Structural complexity as related
  to descriptional complexity. 	Frontiers between decidability and undecidab
 ility. 	Universality and reversibility. 	Nature-motivated (bio-inspired) ar
 chitectures and unconventional models of computing. 	Blum Static (Kolmogoro
 v/Chaitin) complexity, algorithmic information. 
LOCATION:Università degli Studi
DTSTAMP:20181223T124310Z
DTSTART:20170703T063000Z
DTEND:20170705T150000Z
END:VEVENT
END:VCALENDAR