allconferencecfpalerts
   

Event       Publishers
  • Home
  • Login
  • Categories
  • Archive
  • Post Cfp
  • Academic Resources
  • Contact Us

 

Descriptional Complexity of Formal systems and Structures

google+
Views: 760                 

When :  2017-07-03

Where :  Milano, Italy

Submission Deadline :  2017-03-14

Categories :   Education ,  Knowledge Management      

Descriptional Complexity of Formal systems and Structures(DCFS 2017)
July 3-5, 2017, Milano, Italy

Call for Papers:

DCFS 2017 will be held in Milano, Italy, on July 3-5, 2017. The conference is organized by Department of Computer Science, University of Milano, and by the IFIP Working Group 1.02 “Descriptional Complexity”.
Submissions concerning the descriptional complexity of formal systems and structures (and its applications) are invited for DCFS

Topics of Interest:

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

Important Dates:

  • Paper submission deadline:March 14, 2017 (23:59 AoE)
  • Author notification: April 15, 2017
  • Camera-ready deadline: April 25, 2017

 

User Name : shaun
Posted 22-02-2017 on 21:26:34 AEDT


Related CFPs

EDUPT 2026   5th International Conference on Education, Pedagogy and Technology (EDUPT 2026)
WiMoNe 2026   18th International Conference on Wireless & Mobile Networks
CDKP 2026   15th International Conference on Data Mining & Knowledge Management Process (CDKP 2026)
AISO 2026   12th International Conference on Artificial Intelligence and Soft Computing

All Rights Reserved @ Call for Papers - Conference & Journals