THE FIELDS INSTITUTE FOR RESEARCH IN MATHEMATICAL SCIENCES
July 22-25, 2013, 15th Workshop on Descriptional Complexity of Formal Systems ( DCFS 2013)

WORKSHOP SCIENTIFIC AREA

The theories of automata, grammars and related formal systems are cornerstones of the theoretical foundations of computer science. Issues concerning the descriptional complexity of such formal systems have an immediate influence on their application to modelling physical systems. The problem areas to be addressed include, but are not limited to, the following:

• 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 modelling or in modelling natural languages-- and their complexity constraints.
• Co-operating formal systems.
• Size or structural complexity of formal systems for modelling 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.
• Kolmogorov-Chaitin complexity, algorithmic information.
  

 

Top